Base | Representation |
---|---|
bin | 11101011101001111101… |
… | …10001011001010011011 |
3 | 10120202111022101111022210 |
4 | 32232213312023022123 |
5 | 113040322111424011 |
6 | 2052545001250203 |
7 | 133060415123655 |
oct | 16564766131233 |
9 | 3522438344283 |
10 | 1012133311131 |
11 | 360274960158 |
12 | 1441a9493963 |
13 | 7459cc37c97 |
14 | 36db7a476d5 |
15 | 1b4dba6b6a6 |
hex | eba7d8b29b |
1012133311131 has 8 divisors (see below), whose sum is σ = 1374973554960. Its totient is φ = 662024304032.
The previous prime is 1012133311129. The next prime is 1012133311157. The reversal of 1012133311131 is 1311133312101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1012133311131 - 21 = 1012133311129 is a prime.
It is a super-2 number, since 2×10121333111312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1012133311098 and 1012133311107.
It is not an unprimeable number, because it can be changed into a prime (1012133311121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3182808996 + ... + 3182809313.
It is an arithmetic number, because the mean of its divisors is an integer number (171871694370).
Almost surely, 21012133311131 is an apocalyptic number.
1012133311131 is a deficient number, since it is larger than the sum of its proper divisors (362840243829).
1012133311131 is an equidigital number, since it uses as much as digits as its factorization.
1012133311131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6365618365.
The product of its (nonzero) digits is 162, while the sum is 21.
Adding to 1012133311131 its reverse (1311133312101), we get a palindrome (2323266623232).
The spelling of 1012133311131 in words is "one trillion, twelve billion, one hundred thirty-three million, three hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •