Base | Representation |
---|---|
bin | 1001000111000001000101… |
… | …11010000101100101100001 |
3 | 2121221001220100022010200111 |
4 | 10203200202322011211201 |
5 | 10111202134124333441 |
6 | 110334415000251321 |
7 | 4135200252021040 |
oct | 443404272054541 |
9 | 77831810263614 |
10 | 20032313121121 |
11 | 6423724574214 |
12 | 22b6491170b41 |
13 | b24067966352 |
14 | 4d37d798c557 |
15 | 24b146ac4081 |
hex | 123822e85961 |
20032313121121 has 8 divisors (see below), whose sum is σ = 22894759563840. Its totient is φ = 17170038534768.
The previous prime is 20032313121083. The next prime is 20032313121133. The reversal of 20032313121121 is 12112131323002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20032313121121 - 29 = 20032313120609 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20032313121092 and 20032313121101.
It is not an unprimeable number, because it can be changed into a prime (20032313121151) 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, 42714211 + ... + 43180648.
It is an arithmetic number, because the mean of its divisors is an integer number (2861844945480).
Almost surely, 220032313121121 is an apocalyptic number.
It is an amenable number.
20032313121121 is a deficient number, since it is larger than the sum of its proper divisors (2862446442719).
20032313121121 is an equidigital number, since it uses as much as digits as its factorization.
20032313121121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 85928183.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 20032313121121 its reverse (12112131323002), we get a palindrome (32144444444123).
The spelling of 20032313121121 in words is "twenty trillion, thirty-two billion, three hundred thirteen million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •