Base | Representation |
---|---|
bin | 1001000111001111011010… |
… | …1010001111010000011101 |
3 | 1022110220101011112020020101 |
4 | 2101303312222033100131 |
5 | 2303131431003030244 |
6 | 33151043025221101 |
7 | 2052630663506632 |
oct | 221636652172035 |
9 | 38426334466211 |
10 | 10020002001949 |
11 | 3213505a00145 |
12 | 1159b3a491791 |
13 | 578b61084434 |
14 | 268d837b6189 |
15 | 12599ae570d4 |
hex | 91cf6a8f41d |
10020002001949 has 2 divisors, whose sum is σ = 10020002001950. Its totient is φ = 10020002001948.
The previous prime is 10020002001937. The next prime is 10020002002019. The reversal of 10020002001949 is 94910020002001.
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., 7688181381049 + 2331820620900 = 2772757^2 + 1527030^2 .
It is an emirp because it is prime and its reverse (94910020002001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10020002001949 - 221 = 10019999904797 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10020002001749) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5010001000974 + 5010001000975.
It is an arithmetic number, because the mean of its divisors is an integer number (5010001000975).
Almost surely, 210020002001949 is an apocalyptic number.
It is an amenable number.
10020002001949 is a deficient number, since it is larger than the sum of its proper divisors (1).
10020002001949 is an equidigital number, since it uses as much as digits as its factorization.
10020002001949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 28.
The spelling of 10020002001949 in words is "ten trillion, twenty billion, two million, one thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •