Base | Representation |
---|---|
bin | 11001010100010000011000… |
… | …01010000100011100101110 |
3 | 21022010011001102211001020100 |
4 | 30222020030022010130232 |
5 | 24244110333413311011 |
6 | 314223055522531530 |
7 | 14504065255450521 |
oct | 1452101412043456 |
9 | 238104042731210 |
10 | 55671570057006 |
11 | 168141a8a40292 |
12 | 62b1634206ba6 |
13 | 250aa63c3caa7 |
14 | da6738588bb8 |
15 | 66822a596d56 |
hex | 32a20c28472e |
55671570057006 has 12 divisors (see below), whose sum is σ = 120621735123552. Its totient is φ = 18557190018996.
The previous prime is 55671570056987. The next prime is 55671570057007. The reversal of 55671570057006 is 60075007517655.
It is a happy number.
55671570057006 is a `hidden beast` number, since 5 + 5 + 67 + 1 + 5 + 7 + 0 + 0 + 570 + 0 + 6 = 666.
It is a super-2 number, since 2×556715700570062 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55671570057007) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1546432501566 + ... + 1546432501601.
It is an arithmetic number, because the mean of its divisors is an integer number (10051811260296).
Almost surely, 255671570057006 is an apocalyptic number.
55671570057006 is an abundant number, since it is smaller than the sum of its proper divisors (64950165066546).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55671570057006 is a wasteful number, since it uses less digits than its factorization.
55671570057006 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3092865003175 (or 3092865003172 counting only the distinct ones).
The product of its (nonzero) digits is 7717500, while the sum is 54.
The spelling of 55671570057006 in words is "fifty-five trillion, six hundred seventy-one billion, five hundred seventy million, fifty-seven thousand, six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •