Base | Representation |
---|---|
bin | 1001001001111001011111… |
… | …00110000011010000100001 |
3 | 2122021112102121210211200010 |
4 | 10210330233212003100201 |
5 | 10114312410404022241 |
6 | 110452110215515133 |
7 | 4145303430334356 |
oct | 444745746032041 |
9 | 78245377724603 |
10 | 20131310220321 |
11 | 6461705885083 |
12 | 23116bb088aa9 |
13 | b304b3761461 |
14 | 4d850974862d |
15 | 24d9dcc57d16 |
hex | 124f2f983421 |
20131310220321 has 8 divisors (see below), whose sum is σ = 26841778460640. Its totient is φ = 13420857730112.
The previous prime is 20131310220251. The next prime is 20131310220349. The reversal of 20131310220321 is 12302201313102.
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 20131310220321 - 27 = 20131310220193 is a prime.
It is a super-2 number, since 2×201313102203212 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20131310224321) 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, 535131 + ... + 6367808.
It is an arithmetic number, because the mean of its divisors is an integer number (3355222307580).
Almost surely, 220131310220321 is an apocalyptic number.
It is an amenable number.
20131310220321 is a deficient number, since it is larger than the sum of its proper divisors (6710468240319).
20131310220321 is an equidigital number, since it uses as much as digits as its factorization.
20131310220321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7875055.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 20131310220321 its reverse (12302201313102), we get a palindrome (32433511533423).
The spelling of 20131310220321 in words is "twenty trillion, one hundred thirty-one billion, three hundred ten million, two hundred twenty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •