Base | Representation |
---|---|
bin | 1001010111101010010100… |
… | …1100001110000111101101 |
3 | 1100110212112021100202200121 |
4 | 2111322211030032013231 |
5 | 2322242201333120023 |
6 | 33524415405124541 |
7 | 2112205500552430 |
oct | 225724514160755 |
9 | 40425467322617 |
10 | 10302103020013 |
11 | 3312108641392 |
12 | 11a4749559751 |
13 | 59963a89176c |
14 | 2788a56a5817 |
15 | 12ceac063d5d |
hex | 95ea530e1ed |
10302103020013 has 16 divisors (see below), whose sum is σ = 12028865869440. Its totient is φ = 8641144359936.
The previous prime is 10302103019981. The next prime is 10302103020061. The reversal of 10302103020013 is 31002030120301.
It is a cyclic number.
It is not a de Polignac number, because 10302103020013 - 25 = 10302103019981 is a prime.
It is a super-2 number, since 2×103021030200132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10302103020073) 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 15 ways as a sum of consecutive naturals, for example, 85178131 + ... + 85298992.
It is an arithmetic number, because the mean of its divisors is an integer number (751804116840).
Almost surely, 210302103020013 is an apocalyptic number.
It is an amenable number.
10302103020013 is a deficient number, since it is larger than the sum of its proper divisors (1726762849427).
10302103020013 is an equidigital number, since it uses as much as digits as its factorization.
10302103020013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170477316.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 10302103020013 its reverse (31002030120301), we get a palindrome (41304133140314).
The spelling of 10302103020013 in words is "ten trillion, three hundred two billion, one hundred three million, twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •