Recognised as Number
4,640,001
- Positive
- Odd
- Composite
- 7 digits
4,640,001 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,640,001
Digit count7
Digit sum15
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 43 × 35,969
Distinct prime factors33, 43, 35,969
Number of divisors8
Sum of divisors σ(n)6,330,720
Aliquot sum1,690,719sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,021,312integers below n that share no factor with it
Carmichael function λ(n)755,328the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,021,312
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 43, 129, 35,969, 107,907, 1,546,667, 4,640,0018 in total
Arithmetic
Previous number4,640,000
Next number4,640,002
Double9,280,002
Half2,320,000.5
Square21,529,609,280,001
Cube99,897,408,588,813,920,001
Square root2,154.066154973≈irrational, shown to 9 decimal places
Cube root166.79103029≈
Negation-4,640,001
Reciprocal2.15517195 × 10^-7≈
Representations
Decimal4,640,001
Binary1000110110011010000000123 bits
Octal21546401
Hexadecimal46CD01
Base 362RG8X
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, six hundred and forty thousand and one
Ordinalfour million, six hundred and forty thousand and first
Scientific notation4.640001 × 10^6
Engineering notation4.640001 × 10^6
In other bases
Ternary22201201212220base 3; the most digit-efficient integer base after e: 14 digits
Quinary2141440001base 5; one hand: 10 digits
Septenary54303462base 7: 8 digits
Nonary8651786base 9; each digit is two ternary digits: 7 digits
Duodecimal1679229base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal190001base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal21:28:53:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100T1TT1T0T00T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110111101110100000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010001101100110100000001
Bit length23 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits14within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes346 cd 01
Gray code11001011010101110000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010001101100110100000001
64-bit0000000000000000000000000000000000000000010001101100110100000001
One's complement11111111101110010011001011111110at 32 bits, every bit flipped
Bits reversed10000000101100110110001000000000at 32 bits
Rotated left by 100000000100011011001101000000010at 32 bits, wrapping
Shifted left by 1100011011001101000000010= 9,280,002, no wrap
Shifted right by 11000110110011010000000= 2,320,000, discarding the low bit
These bits as a double2.29246509 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,640,001 to the power 221,529,609,280,001
4,640,001 to the power 399,897,408,588,813,920,001
4,640,001 to the power 4463,524,075,749,505,177,618,560,001
4,640,001 to the power 52,150,752,175,001,779,773,655,296,023,200,001
First ten multiples4,640,001, 9,280,002, 13,920,003, 18,560,004, 23,200,005, 27,840,006, 32,480,007, 37,120,008, 41,760,009, 46,400,010
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1206the total stopping time
Highest value reached13,920,0043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,640,001 → 13,920,004 → 6,960,002 → 3,480,001 → 10,440,004 → 5,220,002 → 2,610,001 → 7,830,004 → 3,915,002 → 1,957,501 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage464,000,100%
4,640,001% as a decimal46,400.01
4,640,001% of 1004,640,001
4,640,001% of 1,00046,400,010
As a fraction of 1004,640,001/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 4,640,001
Nerdulate something else
Nothing in mind? Surprise me · today’s page