Base | Representation |
---|---|
bin | 1001001001110111100111… |
… | …01000000101110010010001 |
3 | 2122021102211111122202020101 |
4 | 10210323303220011302101 |
5 | 10114303330323401001 |
6 | 110451422315412401 |
7 | 4145236462544203 |
oct | 444736350056221 |
9 | 78242744582211 |
10 | 20130304122001 |
11 | 6461239976567 |
12 | 231147a154101 |
13 | b3038319a5c8 |
14 | 4d8451c90773 |
15 | 24d97e76ea01 |
hex | 124ef3a05c91 |
20130304122001 has 2 divisors, whose sum is σ = 20130304122002. Its totient is φ = 20130304122000.
The previous prime is 20130304121947. The next prime is 20130304122073. The reversal of 20130304122001 is 10022140303102.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19422080888401 + 708223233600 = 4407049^2 + 841560^2 .
It is a cyclic number.
It is not a de Polignac number, because 20130304122001 - 223 = 20130295733393 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20130304122001.
It is not a weakly prime, because it can be changed into another prime (20130304122301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10065152061000 + 10065152061001.
It is an arithmetic number, because the mean of its divisors is an integer number (10065152061001).
Almost surely, 220130304122001 is an apocalyptic number.
It is an amenable number.
20130304122001 is a deficient number, since it is larger than the sum of its proper divisors (1).
20130304122001 is an equidigital number, since it uses as much as digits as its factorization.
20130304122001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 20130304122001 its reverse (10022140303102), we get a palindrome (30152444425103).
The spelling of 20130304122001 in words is "twenty trillion, one hundred thirty billion, three hundred four million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •