Base | Representation |
---|---|
bin | 11001000010011110011101… |
… | …101111101101011110100100 |
3 | 112102220111100122102100001001 |
4 | 121002132131233231132210 |
5 | 103413211422114011400 |
6 | 1030113011031043044 |
7 | 32124000536341066 |
oct | 3102363557553644 |
9 | 472814318370031 |
10 | 110121313032100 |
11 | 320a7206393807 |
12 | 104262b8b10484 |
13 | 495a51a5074a6 |
14 | 1d29c857db736 |
15 | cae794acea6a |
hex | 64279dbed7a4 |
110121313032100 has 72 divisors (see below), whose sum is σ = 240086566679400. Its totient is φ = 43841782963200.
The previous prime is 110121313032097. The next prime is 110121313032223. The reversal of 110121313032100 is 1230313121011.
It can be written as a sum of positive squares in 12 ways, for example, as 84755444137984 + 25365868894116 = 9206272^2 + 5036454^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 25460136 + ... + 29469664.
It is an arithmetic number, because the mean of its divisors is an integer number (3334535648325).
Almost surely, 2110121313032100 is an apocalyptic number.
110121313032100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110121313032100 is an abundant number, since it is smaller than the sum of its proper divisors (129965253647300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110121313032100 is a wasteful number, since it uses less digits than its factorization.
110121313032100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4010833 (or 4010826 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 110121313032100 its reverse (1230313121011), we get a palindrome (111351626153111).
The spelling of 110121313032100 in words is "one hundred ten trillion, one hundred twenty-one billion, three hundred thirteen million, thirty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •