Nerdulator> put something in

Recognised as Number

4,717,469

  • Positive
  • Odd
  • Prime
  • 7 digits

4,717,469 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,717,469
Digit count7
Digit sum38
Digit product42,336
Multiplicative persistence4times 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 factorisation4,717,469
Distinct prime factors14,717,469
Number of divisors2
Sum of divisors σ(n)4,717,470
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,717,468integers below n that share no factor with it
Carmichael function λ(n)4,717,468the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 4,717,4692 in total

Arithmetic

Previous number4,717,468
Next number4,717,470
Double9,434,938
Cube104,984,978,800,994,272,709
Square root2,171.973526542≈irrational, shown to 9 decimal places
Cube root167.714142091≈
Negation-4,717,469
Reciprocal2.11978076 × 10^-7≈

Representations

Decimal4,717,469
Binary1000111111110111001110123 bits
Octal21775635
Hexadecimal47FB9D
Base 362T40T
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, seven hundred and seventeen thousand, four hundred and sixty-nine
Ordinalfour million, seven hundred and seventeen thousand, four hundred and sixty-ninth
Scientific notation4.717469 × 10^6
Engineering notation4.717469 × 10^6

In other bases

Ternary22212200011002base 3; the most digit-efficient integer base after e: 14 digits
Quinary2201424334base 5; one hand: 10 digits
Septenary55045361base 7: 8 digits
Nonary8780132base 9; each digit is two ternary digits: 7 digits
Duodecimal16b6025base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal199dd9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal21:50:24:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1000T0T0001101Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110000000110011101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010001111111101110011101
Bit length23 bitsto write the magnitude
Set bits16the population count, or Hamming weight
Zero bits7within that length
Bit parityeven16 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 fb 9d
Gray code11001000000011001010011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010001111111101110011101
64-bit0000000000000000000000000000000000000000010001111111101110011101
One's complement11111111101110000000010001100010at 32 bits, every bit flipped
Bits reversed10111001110111111110001000000000at 32 bits
Rotated left by 100000000100011111111011100111010at 32 bits, wrapping
Shifted left by 1100011111111011100111010= 9,434,938, no wrap
Shifted right by 11000111111110111001110= 2,358,734, discarding the low bit
These bits as a double2.33073937 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime4,717,511+42
Previous prime4,717,451−18
Distance to nearest prime0, it is prime
Nearest square below4,713,241
Nearest square above4,717,584

Powers & multiples

4,717,469 to the power 222,254,513,765,961
4,717,469 to the power 3104,984,978,800,994,272,709
4,717,469 to the power 4495,263,382,959,347,650,682,253,521
4,717,469 to the power 52,336,389,655,945,850,802,316,359,835,458,349
First ten multiples4,717,469, 9,434,938, 14,152,407, 18,869,876, 23,587,345, 28,304,814, 33,022,283, 37,739,752, 42,457,221, 47,174,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 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 69

Collatz (3n + 1) trajectory

Steps to reach 1224the total stopping time
Highest value reached15,112,9603× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,717,469 → 14,152,408 → 7,076,204 → 3,538,102 → 1,769,051 → 5,307,154 → 2,653,577 → 7,960,732 → 3,980,366 → 1,990,183 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage471,746,900%
4,717,469% as a decimal47,174.69
4,717,469% of 1004,717,469
4,717,469% of 1,00047,174,690
As a fraction of 1004,717,469/100

Read another way

As bytes4.499 MiB
As a 24-bit colour#47FB9D

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “4717469” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.