Base | Representation |
---|---|
bin | 1001001001110111011010… |
… | …11110110000011100000001 |
3 | 2122021102120022122012212022 |
4 | 10210323231132300130001 |
5 | 10114303122424340334 |
6 | 110451404153411225 |
7 | 4145234101246646 |
oct | 444735536603401 |
9 | 78242508565768 |
10 | 20130201011969 |
11 | 6461196750464 |
12 | 231144b709b15 |
13 | b30367a08359 |
14 | 4d84422cddcd |
15 | 24d9756a382e |
hex | 124eed7b0701 |
20130201011969 has 2 divisors, whose sum is σ = 20130201011970. Its totient is φ = 20130201011968.
The previous prime is 20130201011861. The next prime is 20130201011971. The reversal of 20130201011969 is 96911010203102.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19778477290000 + 351723721969 = 4447300^2 + 593063^2 .
It is a cyclic number.
It is not a de Polignac number, because 20130201011969 - 236 = 20061481535233 is a prime.
It is a super-2 number, since 2×201302010119692 (a number of 27 digits) contains 22 as substring.
Together with 20130201011971, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (20130201011069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10065100505984 + 10065100505985.
It is an arithmetic number, because the mean of its divisors is an integer number (10065100505985).
Almost surely, 220130201011969 is an apocalyptic number.
It is an amenable number.
20130201011969 is a deficient number, since it is larger than the sum of its proper divisors (1).
20130201011969 is an equidigital number, since it uses as much as digits as its factorization.
20130201011969 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5832, while the sum is 35.
The spelling of 20130201011969 in words is "twenty trillion, one hundred thirty billion, two hundred one million, eleven thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •