Base | Representation |
---|---|
bin | 1001101100010000110000… |
… | …00110111101100110101011 |
3 | 2210110102002011112002212211 |
4 | 10312020120012331212223 |
5 | 10243134020220414011 |
6 | 113154340141345551 |
7 | 4326513011514010 |
oct | 466103006754653 |
9 | 83412064462784 |
10 | 21312032201131 |
11 | 6877422635001 |
12 | 24824b85682b7 |
13 | bb79401087c9 |
14 | 539717807707 |
15 | 26e59528cb21 |
hex | 1362181bd9ab |
21312032201131 has 16 divisors (see below), whose sum is σ = 24408860544000. Its totient is φ = 18228277267200.
The previous prime is 21312032201107. The next prime is 21312032201183. The reversal of 21312032201131 is 13110223021312.
It is not a de Polignac number, because 21312032201131 - 213 = 21312032192939 is a prime.
It is a super-2 number, since 2×213120322011312 (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 (21312032201431) 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, 24551835 + ... + 25405051.
It is an arithmetic number, because the mean of its divisors is an integer number (1525553784000).
Almost surely, 221312032201131 is an apocalyptic number.
21312032201131 is a deficient number, since it is larger than the sum of its proper divisors (3096828342869).
21312032201131 is an equidigital number, since it uses as much as digits as its factorization.
21312032201131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 860874.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 21312032201131 its reverse (13110223021312), we get a palindrome (34422255222443).
It can be divided in two parts, 2131203 and 2201131, that added together give a palindrome (4332334).
The spelling of 21312032201131 in words is "twenty-one trillion, three hundred twelve billion, thirty-two million, two hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •