Base | Representation |
---|---|
bin | 10000000000101111100… |
… | …101111011110101010011 |
3 | 10220012002111120112210020 |
4 | 100000233211323311103 |
5 | 121011413341220311 |
6 | 2201250412034523 |
7 | 142331465355030 |
oct | 20005745736523 |
9 | 3805074515706 |
10 | 1100310101331 |
11 | 394703404791 |
12 | 1592b7762a43 |
13 | 7c9b3101a9c |
14 | 3b38074a387 |
15 | 1d94cd07c06 |
hex | 1002f97bd53 |
1100310101331 has 16 divisors (see below), whose sum is σ = 1676679089664. Its totient is φ = 628742600064.
The previous prime is 1100310101321. The next prime is 1100310101351. The reversal of 1100310101331 is 1331010130011.
It is not a de Polignac number, because 1100310101331 - 27 = 1100310101203 is a prime.
It is a super-2 number, since 2×11003101013312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1100310101331.
It is not an unprimeable number, because it can be changed into a prime (1100310101321) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2924395 + ... + 3279131.
It is an arithmetic number, because the mean of its divisors is an integer number (104792443104).
Almost surely, 21100310101331 is an apocalyptic number.
1100310101331 is a deficient number, since it is larger than the sum of its proper divisors (576368988333).
1100310101331 is a wasteful number, since it uses less digits than its factorization.
1100310101331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 502450.
The product of its (nonzero) digits is 27, while the sum is 15.
Adding to 1100310101331 its reverse (1331010130011), we get a palindrome (2431320231342).
The spelling of 1100310101331 in words is "one trillion, one hundred billion, three hundred ten million, one hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •