Base | Representation |
---|---|
bin | 10000011101010101101… |
… | …001000101010110100001 |
3 | 11000010100020221012011012 |
4 | 100131111221011112201 |
5 | 122012303341411113 |
6 | 2223325202430305 |
7 | 144466363564436 |
oct | 20352551052641 |
9 | 4003306835135 |
10 | 1131013232033 |
11 | 3a6729536273 |
12 | 163246062395 |
13 | 82867061249 |
14 | 3ca54305b8d |
15 | 1e648521aa8 |
hex | 10755a455a1 |
1131013232033 has 8 divisors (see below), whose sum is σ = 1171551179880. Its totient is φ = 1090577783680.
The previous prime is 1131013232021. The next prime is 1131013232053. The reversal of 1131013232033 is 3302323101311.
It can be written as a sum of positive squares in 4 ways, for example, as 2004979729 + 1129008252304 = 44777^2 + 1062548^2 .
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 1131013232033 - 212 = 1131013227937 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1131013232053) 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, 25602410 + ... + 25646547.
It is an arithmetic number, because the mean of its divisors is an integer number (146443897485).
Almost surely, 21131013232033 is an apocalyptic number.
It is an amenable number.
1131013232033 is a deficient number, since it is larger than the sum of its proper divisors (40537947847).
1131013232033 is an equidigital number, since it uses as much as digits as its factorization.
1131013232033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51249747.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 1131013232033 its reverse (3302323101311), we get a palindrome (4433336333344).
The spelling of 1131013232033 in words is "one trillion, one hundred thirty-one billion, thirteen million, two hundred thirty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •