Base | Representation |
---|---|
bin | 1001001101001100001000… |
… | …1100100001011100101101 |
3 | 1022211200011120222212012021 |
4 | 2103103002030201130231 |
5 | 2311320231424341023 |
6 | 33310024104510141 |
7 | 2063206401662326 |
oct | 223230214413455 |
9 | 38750146885167 |
10 | 10122201012013 |
11 | 325288a64a032 |
12 | 117590077b351 |
13 | 58569a339a5c |
14 | 26dcba8d744d |
15 | 12847d26535d |
hex | 934c232172d |
10122201012013 has 8 divisors (see below), whose sum is σ = 10354999678848. Its totient is φ = 9890128707264.
The previous prime is 10122201011921. The next prime is 10122201012019. The reversal of 10122201012013 is 31021010222101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10122201012013 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 (10122201012019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 181562331 + ... + 181618072.
It is an arithmetic number, because the mean of its divisors is an integer number (1294374959856).
Almost surely, 210122201012013 is an apocalyptic number.
It is an amenable number.
10122201012013 is a deficient number, since it is larger than the sum of its proper divisors (232798666835).
10122201012013 is an equidigital number, since it uses as much as digits as its factorization.
10122201012013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 363181043.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 10122201012013 its reverse (31021010222101), we get a palindrome (41143211234114).
The spelling of 10122201012013 in words is "ten trillion, one hundred twenty-two billion, two hundred one million, twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •