Recognised as Number
5,467,799
- Positive
- Odd
- Prime
- 7 digits
5,467,799 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 value5,467,799
Digit count7
Digit sum47
Digit product476,280
Multiplicative persistence2times 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 factorisation5,467,799
Distinct prime factors15,467,799
Number of divisors2
Sum of divisors σ(n)5,467,800
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,467,798integers below n that share no factor with it
Carmichael function λ(n)5,467,798the 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, 5,467,7992 in total
Arithmetic
Previous number5,467,798
Next number5,467,800
Double10,935,598
Half2,733,899.5
Square29,896,825,904,401
Cube163,469,834,783,257,883,399
Square root2,338.33252554≈irrational, shown to 9 decimal places
Cube root176.172255167≈
Negation-5,467,799
Reciprocal1.82888947 × 10^-7≈
Representations
Decimal5,467,799
Binary1010011011011101001011123 bits
Octal24667227
Hexadecimal536E97
Base 36396ZB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, four hundred and sixty-seven thousand, seven hundred and ninety-nine
Ordinalfive million, four hundred and sixty-seven thousand, seven hundred and ninety-ninth
Scientific notation5.467799 × 10^6
Engineering notation5.467799 × 10^6
In other bases
Ternary101021210102002base 3; the most digit-efficient integer base after e: 15 digits
Quinary2344432144base 5; one hand: 10 digits
Septenary64322051base 7: 8 digits
Nonary11253362base 9; each digit is two ternary digits: 8 digits
Duodecimal19b829bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1e399jbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal25:18:49:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10110TT1011T01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101001011001111101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010100110110111010010111
Bit length23 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits9within that length
Bit parityeven14 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
Bytes353 6e 97
Gray code11110101101100111011100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010100110110111010010111
64-bit0000000000000000000000000000000000000000010100110110111010010111
One's complement11111111101011001001000101101000at 32 bits, every bit flipped
Bits reversed11101001011101101100101000000000at 32 bits
Rotated left by 100000000101001101101110100101110at 32 bits, wrapping
Shifted left by 1101001101101110100101110= 10,935,598, no wrap
Shifted right by 11010011011011101001011= 2,733,899, discarding the low bit
These bits as a double2.70145164 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,467,799 to the power 229,896,825,904,401
5,467,799 to the power 3163,469,834,783,257,883,399
5,467,799 to the power 4893,820,199,158,062,671,591,168,801
5,467,799 to the power 54,887,229,191,136,255,917,663,521,178,938,999
First ten multiples5,467,799, 10,935,598, 16,403,397, 21,871,196, 27,338,995, 32,806,794, 38,274,593, 43,742,392, 49,210,191, 54,677,990
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 11
Divisible by 100No, remainder 99
Collatz (3n + 1) trajectory
Steps to reach 156the total stopping time
Highest value reached36,907,6486× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,467,799 → 16,403,398 → 8,201,699 → 24,605,098 → 12,302,549 → 36,907,648 → 18,453,824 → 9,226,912 → 4,613,456 → 2,306,728 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage546,779,900%
5,467,799% as a decimal54,677.99
5,467,799% of 1005,467,799
5,467,799% of 1,00054,677,990
As a fraction of 1005,467,799/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 5,467,799
Nerdulate something else
Nothing in mind? Surprise me · today’s page