Base | Representation |
---|---|
bin | 100101001001011100000… |
… | …1001010101000110001110 |
3 | 200002002012210221000021000 |
4 | 1022102320021111012032 |
5 | 1132122041203213402 |
6 | 14505234510521130 |
7 | 1034601212034102 |
oct | 112227011250616 |
9 | 20062183830230 |
10 | 5105510601102 |
11 | 16992646a784a |
12 | 6a55952061a6 |
13 | 2b05a8459a02 |
14 | 13917261d902 |
15 | 8cc15621c1c |
hex | 4a4b825518e |
5105510601102 has 32 divisors (see below), whose sum is σ = 12012966122400. Its totient is φ = 1601728815744.
The previous prime is 5105510601029. The next prime is 5105510601143. The reversal of 5105510601102 is 2011060155015.
5105510601102 is a `hidden beast` number, since 5 + 1 + 0 + 5 + 51 + 0 + 601 + 1 + 0 + 2 = 666.
It is a super-2 number, since 2×51055106011022 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2780778277 + ... + 2780780112.
It is an arithmetic number, because the mean of its divisors is an integer number (375405191325).
Almost surely, 25105510601102 is an apocalyptic number.
5105510601102 is an abundant number, since it is smaller than the sum of its proper divisors (6907455521298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5105510601102 is a wasteful number, since it uses less digits than its factorization.
5105510601102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5561558417 (or 5561558411 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 27.
Adding to 5105510601102 its reverse (2011060155015), we get a palindrome (7116570756117).
The spelling of 5105510601102 in words is "five trillion, one hundred five billion, five hundred ten million, six hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •