Recognised as Number
4,777,433
- Positive
- Odd
- Prime
- 7 digits
4,777,433 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,777,433
Digit count7
Digit sum35
Digit product49,392
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation4,777,433
Distinct prime factors14,777,433
Number of divisors2
Sum of divisors σ(n)4,777,434
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,777,432integers below n that share no factor with it
Carmichael function λ(n)4,777,432the 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,777,4332 in total
Arithmetic
Previous number4,777,432
Next number4,777,434
Double9,554,866
Half2,388,716.5
Square22,823,866,069,489
Cube109,039,490,947,957,041,737
Square root2,185.733972834≈irrational, shown to 9 decimal places
Cube root168.421760117≈
Negation-4,777,433
Reciprocal2.09317431 × 10^-7≈
Representations
Decimal4,777,433
Binary1001000111001011101100123 bits
Octal22162731
Hexadecimal48E5D9
Base 362UEAH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, seven hundred and seventy-seven thousand, four hundred and thirty-three
Ordinalfour million, seven hundred and seventy-seven thousand, four hundred and thirty-third
Scientific notation4.777433 × 10^6
Engineering notation4.777433 × 10^6
In other bases
Ternary22222201101222base 3; the most digit-efficient integer base after e: 14 digits
Quinary2210334213base 5; one hand: 10 digits
Septenary55415243base 7: 8 digits
Nonary8881358base 9; each digit is two ternary digits: 7 digits
Duodecimal1724875base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal19h3bdbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal22:7:3:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100000T0111T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110010011101000101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010010001110010111011001
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 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
Bytes348 e5 d9
Gray code11011001001011100110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010010001110010111011001
64-bit0000000000000000000000000000000000000000010010001110010111011001
One's complement11111111101101110001101000100110at 32 bits, every bit flipped
Bits reversed10011011101001110001001000000000at 32 bits
Rotated left by 100000000100100011100101110110010at 32 bits, wrapping
Shifted left by 1100100011100101110110010= 9,554,866, no wrap
Shifted right by 11001000111001011101100= 2,388,716, discarding the low bit
These bits as a double2.36036552 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,777,433 to the power 222,823,866,069,489
4,777,433 to the power 3109,039,490,947,957,041,737
4,777,433 to the power 4520,928,862,357,971,253,776,721,121
4,777,433 to the power 52,488,702,737,681,429,680,844,282,115,262,393
First ten multiples4,777,433, 9,554,866, 14,332,299, 19,109,732, 23,887,165, 28,664,598, 33,442,031, 38,219,464, 42,996,897, 47,774,330
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 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 1
Divisible by 12No, remainder 5
Divisible by 100No, remainder 33
Collatz (3n + 1) trajectory
Steps to reach 1144the total stopping time
Highest value reached16,123,8403× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,777,433 → 14,332,300 → 7,166,150 → 3,583,075 → 10,749,226 → 5,374,613 → 16,123,840 → 8,061,920 → 4,030,960 → 2,015,480 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage477,743,300%
4,777,433% as a decimal47,774.33
4,777,433% of 1004,777,433
4,777,433% of 1,00047,774,330
As a fraction of 1004,777,433/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,777,433
Nerdulate something else
Nothing in mind? Surprise me · today’s page