Base | Representation |
---|---|
bin | 11001010111001000110010… |
… | …01101010111000101111110 |
3 | 21022110121121010211102201110 |
4 | 30223210121031113011332 |
5 | 24302221113224141142 |
6 | 314340351521222450 |
7 | 14514201540053562 |
oct | 1453443115270576 |
9 | 238417533742643 |
10 | 55770573271422 |
11 | 16852192748649 |
12 | 6308864191a26 |
13 | 25171b1099479 |
14 | dab44b0976a2 |
15 | 66aac203799c |
hex | 32b91935717e |
55770573271422 has 8 divisors (see below), whose sum is σ = 111541146542856. Its totient is φ = 18590191090472.
The previous prime is 55770573271393. The next prime is 55770573271451. The reversal of 55770573271422 is 22417237507755.
It is an interprime number because it is at equal distance from previous prime (55770573271393) and next prime (55770573271451).
It is a sphenic number, since it is the product of 3 distinct primes.
55770573271422 is an admirable number.
It is a super-2 number, since 2×557705732714222 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4647547772613 + ... + 4647547772624.
It is an arithmetic number, because the mean of its divisors is an integer number (13942643317857).
Almost surely, 255770573271422 is an apocalyptic number.
55770573271422 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55770573271422 is a wasteful number, since it uses less digits than its factorization.
55770573271422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9295095545242.
The product of its (nonzero) digits is 28812000, while the sum is 57.
The spelling of 55770573271422 in words is "fifty-five trillion, seven hundred seventy billion, five hundred seventy-three million, two hundred seventy-one thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •