Base | Representation |
---|---|
bin | 10000000000101111110… |
… | …001000001111111010011 |
3 | 10220012002201001022220120 |
4 | 100000233301001333103 |
5 | 121011420112311011 |
6 | 2201250554241323 |
7 | 142331532161346 |
oct | 20005761017723 |
9 | 3805081038816 |
10 | 1100313010131 |
11 | 394705011155 |
12 | 1592b8726243 |
13 | 7c9b38aca7a |
14 | 3b380ca645d |
15 | 1d94d1cea06 |
hex | 1002fc41fd3 |
1100313010131 has 32 divisors (see below), whose sum is σ = 1511503039488. Its totient is φ = 711459728640.
The previous prime is 1100313010117. The next prime is 1100313010133. The reversal of 1100313010131 is 1310103130011.
It is not a de Polignac number, because 1100313010131 - 26 = 1100313010067 is a prime.
It is a super-2 number, since 2×11003130101312 (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 1100313010131.
It is not an unprimeable number, because it can be changed into a prime (1100313010133) 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 31 ways as a sum of consecutive naturals, for example, 125587791 + ... + 125596551.
It is an arithmetic number, because the mean of its divisors is an integer number (47234469984).
Almost surely, 21100313010131 is an apocalyptic number.
1100313010131 is a deficient number, since it is larger than the sum of its proper divisors (411190029357).
1100313010131 is a wasteful number, since it uses less digits than its factorization.
1100313010131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12251.
The product of its (nonzero) digits is 27, while the sum is 15.
Adding to 1100313010131 its reverse (1310103130011), we get a palindrome (2410416140142).
The spelling of 1100313010131 in words is "one trillion, one hundred billion, three hundred thirteen million, ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •