Recognised as Number
1,464,631
- Positive
- Odd
- Composite
- 7 digits
1,464,631 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,464,631
Digit count7
Digit sum25
Digit product1,728
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7 × 209,233
Distinct prime factors27, 209,233
Number of divisors4
Sum of divisors σ(n)1,673,872
Aliquot sum209,241sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,255,392integers below n that share no factor with it
Carmichael function λ(n)209,232the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,255,392
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 209,233, 1,464,6314 in total
Arithmetic
Previous number1,464,630
Next number1,464,632
Double2,929,262
Half732,315.5
Square2,145,143,966,161
Cube3,141,844,352,302,351,591
Square root1,210.219401596≈irrational, shown to 9 decimal places
Cube root113.564538583≈
Negation-1,464,631
Reciprocal6.8276583 × 10^-7≈
Representations
Decimal1,464,631
Binary10110010110010011011121 bits
Octal5454467
Hexadecimal165937
Base 36VE47
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and sixty-four thousand, six hundred and thirty-one
Ordinalone million, four hundred and sixty-four thousand, six hundred and thirty-first
Scientific notation1.464631 × 10^6
Engineering notation1.464631 × 10^6
In other bases
Ternary2202102002121base 3; the most digit-efficient integer base after e: 13 digits
Quinary333332011base 5; one hand: 9 digits
Septenary15310030base 7: 8 digits
Nonary2672077base 9; each digit is two ternary digits: 7 digits
Duodecimal5a7707base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal931bbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:46:50:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T1T11T010TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010111010100101001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101100101100100110111
Bit length21 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits9within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes316 59 37
Gray code111010111010110101100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101100101100100110111
64-bit0000000000000000000000000000000000000000000101100101100100110111
One's complement11111111111010011010011011001000at 32 bits, every bit flipped
Bits reversed11101100100110100110100000000000at 32 bits
Rotated left by 100000000001011001011001001101110at 32 bits, wrapping
Shifted left by 11011001011001001101110= 2,929,262, no wrap
Shifted right by 110110010110010011011= 732,315, discarding the low bit
These bits as a double7.23623861 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,464,631 to the power 22,145,143,966,161
1,464,631 to the power 33,141,844,352,302,351,591
1,464,631 to the power 44,601,642,635,556,945,513,077,921
1,464,631 to the power 56,739,708,454,958,404,663,764,828,512,151
First ten multiples1,464,631, 2,929,262, 4,393,893, 5,858,524, 7,323,155, 8,787,786, 10,252,417, 11,717,048, 13,181,679, 14,646,310
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 1243the total stopping time
Highest value reached10,557,2687× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,464,631 → 4,393,894 → 2,196,947 → 6,590,842 → 3,295,421 → 9,886,264 → 4,943,132 → 2,471,566 → 1,235,783 → 3,707,350 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage146,463,100%
1,464,631% as a decimal14,646.31
1,464,631% of 1001,464,631
1,464,631% of 1,00014,646,310
As a fraction of 1001,464,631/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 1,464,631
Nerdulate something else
Nothing in mind? Surprise me · today’s page