Base | Representation |
---|---|
bin | 1001010001101110000000… |
… | …0110101011111101100111 |
3 | 1100010010000101111021022212 |
4 | 2110123200012223331213 |
5 | 2314104111111210043 |
6 | 33405453152514035 |
7 | 2101632545154116 |
oct | 224334006537547 |
9 | 40103011437285 |
10 | 10200012210023 |
11 | 3282889a84849 |
12 | 11889b754b91b |
13 | 58cb1ab6115c |
14 | 27397caabc7d |
15 | 12a4d44ca018 |
hex | 946e01abf67 |
10200012210023 has 4 divisors (see below), whose sum is σ = 10207745351760. Its totient is φ = 10192279068288.
The previous prime is 10200012210019. The next prime is 10200012210079. The reversal of 10200012210023 is 32001221000201.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10200012210023 - 22 = 10200012210019 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 (10200012210823) 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 in 3 ways as a sum of consecutive naturals, for example, 3866568890 + ... + 3866571527.
It is an arithmetic number, because the mean of its divisors is an integer number (2551936337940).
Almost surely, 210200012210023 is an apocalyptic number.
10200012210023 is a deficient number, since it is larger than the sum of its proper divisors (7733141737).
10200012210023 is an equidigital number, since it uses as much as digits as its factorization.
10200012210023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7733141736.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 10200012210023 its reverse (32001221000201), we get a palindrome (42201233210224).
The spelling of 10200012210023 in words is "ten trillion, two hundred billion, twelve million, two hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •