Base | Representation |
---|---|
bin | 1001001001111011001011… |
… | …10101011101100101111101 |
3 | 2122021121210001011010021210 |
4 | 10210331211311131211331 |
5 | 10114321241334330023 |
6 | 110452340404315033 |
7 | 4145335120313013 |
oct | 444754565354575 |
9 | 78247701133253 |
10 | 20132220230013 |
11 | 6462032523901 |
12 | 23119139a2a79 |
13 | b305ca150c28 |
14 | 4d859454c8b3 |
15 | 24da42ab0593 |
hex | 124f65d5d97d |
20132220230013 has 4 divisors (see below), whose sum is σ = 26842960306688. Its totient is φ = 13421480153340.
The previous prime is 20132220229969. The next prime is 20132220230029. The reversal of 20132220230013 is 31003202223102.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 20132220230013 - 28 = 20132220229757 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20132220230413) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3355370038333 + ... + 3355370038338.
It is an arithmetic number, because the mean of its divisors is an integer number (6710740076672).
Almost surely, 220132220230013 is an apocalyptic number.
It is an amenable number.
20132220230013 is a deficient number, since it is larger than the sum of its proper divisors (6710740076675).
20132220230013 is an equidigital number, since it uses as much as digits as its factorization.
20132220230013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6710740076674.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 20132220230013 its reverse (31003202223102), we get a palindrome (51135422453115).
The spelling of 20132220230013 in words is "twenty trillion, one hundred thirty-two billion, two hundred twenty million, two hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •