Recognised as Number
4,690,469
- Positive
- Odd
- Composite
- 7 digits
4,690,469 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,690,469
Digit count7
Digit sum38
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7 × 67 × 73 × 137
Distinct prime factors47, 67, 73, 137
Number of divisors16
Sum of divisors σ(n)5,555,328
Aliquot sum864,859sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,877,632integers below n that share no factor with it
Carmichael function λ(n)13,464the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,877,632
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 67, 73, 137, 469, 511, 959, 4,891, 9,179, 10,001, 34,237, 64,253, 70,007, 670,067, 4,690,46916 in total
Arithmetic
Previous number4,690,468
Next number4,690,470
Double9,380,938
Half2,345,234.5
Square22,000,499,439,961
Cube103,192,660,607,654,431,709
Square root2,165.749062103≈irrational, shown to 9 decimal places
Cube root167.393564222≈
Negation-4,690,469
Reciprocal2.13198296 × 10^-7≈
Representations
Decimal4,690,469
Binary1000111100100100010010123 bits
Octal21711045
Hexadecimal479225
Base 362SJ6T
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, six hundred and ninety thousand, four hundred and sixty-nine
Ordinalfour million, six hundred and ninety thousand, four hundred and sixty-ninth
Scientific notation4.690469 × 10^6
Engineering notation4.690469 × 10^6
In other bases
Ternary22211022010002base 3; the most digit-efficient integer base after e: 14 digits
Quinary2200043334base 5; one hand: 10 digits
Septenary54603560base 7: 8 digits
Nonary8738102base 9; each digit is two ternary digits: 7 digits
Duodecimal16a2485base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal196639base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal21:42:54:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100T1110T01001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110001001011001100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010001111001001000100101
Bit length23 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits13within that length
Bit parityeven10 set bits, so even; 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
Bytes347 92 25
Gray code11001000101101100110111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010001111001001000100101
64-bit0000000000000000000000000000000000000000010001111001001000100101
One's complement11111111101110000110110111011010at 32 bits, every bit flipped
Bits reversed10100100010010011110001000000000at 32 bits
Rotated left by 100000000100011110010010001001010at 32 bits, wrapping
Shifted left by 1100011110010010001001010= 9,380,938, no wrap
Shifted right by 11000111100100100010010= 2,345,234, discarding the low bit
These bits as a double2.3173996 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,690,469 to the power 222,000,499,439,961
4,690,469 to the power 3103,192,660,607,654,431,709
4,690,469 to the power 4484,021,975,607,724,274,643,681,521
4,690,469 to the power 52,270,290,071,906,786,870,763,674,220,123,349
First ten multiples4,690,469, 9,380,938, 14,071,407, 18,761,876, 23,452,345, 28,142,814, 32,833,283, 37,523,752, 42,214,221, 46,904,690
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 5
Divisible by 100No, remainder 69
Collatz (3n + 1) trajectory
Steps to reach 1206the total stopping time
Highest value reached33,809,5607× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,690,469 → 14,071,408 → 7,035,704 → 3,517,852 → 1,758,926 → 879,463 → 2,638,390 → 1,319,195 → 3,957,586 → 1,978,793 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage469,046,900%
4,690,469% as a decimal46,904.69
4,690,469% of 1004,690,469
4,690,469% of 1,00046,904,690
As a fraction of 1004,690,469/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,690,469
Nerdulate something else
Nothing in mind? Surprise me · today’s page