Base | Representation |
---|---|
bin | 11001000010011111001000… |
… | …00000000110111011000110 |
3 | 21012221210002112020100222212 |
4 | 30201033210000012323012 |
5 | 24204104422304013110 |
6 | 313034402415223422 |
7 | 14412012116220656 |
oct | 1441174400067306 |
9 | 235853075210885 |
10 | 55061011001030 |
11 | 165a92752aa751 |
12 | 6213239217b72 |
13 | 2495300833988 |
14 | d84d77c16366 |
15 | 6573e3739e05 |
hex | 3213e4006ec6 |
55061011001030 has 16 divisors (see below), whose sum is σ = 101527132480704. Its totient is φ = 21487223805120.
The previous prime is 55061011001023. The next prime is 55061011001039. The reversal of 55061011001030 is 3010011016055.
It is a super-2 number, since 2×550610110010302 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 55061011000987 and 55061011001005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55061011001039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 67147573982 + ... + 67147574801.
It is an arithmetic number, because the mean of its divisors is an integer number (6345445780044).
Almost surely, 255061011001030 is an apocalyptic number.
55061011001030 is a deficient number, since it is larger than the sum of its proper divisors (46466121479674).
55061011001030 is a wasteful number, since it uses less digits than its factorization.
55061011001030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134295148831.
The product of its (nonzero) digits is 450, while the sum is 23.
Adding to 55061011001030 its reverse (3010011016055), we get a palindrome (58071022017085).
The spelling of 55061011001030 in words is "fifty-five trillion, sixty-one billion, eleven million, one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •