Base | Representation |
---|---|
bin | 1001001101110000101101… |
… | …1110010000011001100011 |
3 | 1022212121111220210000010011 |
4 | 2103130023132100121203 |
5 | 2312000334201112011 |
6 | 33314330314545351 |
7 | 2064004623554635 |
oct | 223341336203143 |
9 | 38777456700104 |
10 | 10132020332131 |
11 | 3256a69377625 |
12 | 11777a1138257 |
13 | 5865a3775a49 |
14 | 27056ca66a55 |
15 | 128855333621 |
hex | 9370b790663 |
10132020332131 has 8 divisors (see below), whose sum is σ = 10371507277824. Its totient is φ = 9892708775880.
The previous prime is 10132020332123. The next prime is 10132020332149. The reversal of 10132020332131 is 13123302023101.
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 10132020332131 - 23 = 10132020332123 is a prime.
It is a super-2 number, since 2×101320203321312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10132020032131) 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, 43730455 + ... + 43961536.
It is an arithmetic number, because the mean of its divisors is an integer number (1296438409728).
Almost surely, 210132020332131 is an apocalyptic number.
10132020332131 is a deficient number, since it is larger than the sum of its proper divisors (239486945693).
10132020332131 is an equidigital number, since it uses as much as digits as its factorization.
10132020332131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87694721.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 10132020332131 its reverse (13123302023101), we get a palindrome (23255322355232).
The spelling of 10132020332131 in words is "ten trillion, one hundred thirty-two billion, twenty million, three hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •