Base | Representation |
---|---|
bin | 11101011001010011111… |
… | …00101111000110111101 |
3 | 10120120001002220011010110 |
4 | 32230221330233012331 |
5 | 113022010400231023 |
6 | 2051555225300233 |
7 | 132654156466620 |
oct | 16545174570675 |
9 | 3516032804113 |
10 | 1010021102013 |
11 | 35a390643190 |
12 | 1438ba034679 |
13 | 74324463bc1 |
14 | 36c572dddb7 |
15 | 1b4163e1a93 |
hex | eb29f2f1bd |
1010021102013 has 32 divisors (see below), whose sum is σ = 1679802964992. Its totient is φ = 524434147200.
The previous prime is 1010021101993. The next prime is 1010021102081. The reversal of 1010021102013 is 3102011200101.
It is not a de Polignac number, because 1010021102013 - 25 = 1010021101981 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1010021102013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010021102113) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 568368 + ... + 1530713.
It is an arithmetic number, because the mean of its divisors is an integer number (52493842656).
Almost surely, 21010021102013 is an apocalyptic number.
It is an amenable number.
1010021102013 is a deficient number, since it is larger than the sum of its proper divisors (669781862979).
1010021102013 is a wasteful number, since it uses less digits than its factorization.
1010021102013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2101185.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 1010021102013 its reverse (3102011200101), we get a palindrome (4112032302114).
The spelling of 1010021102013 in words is "one trillion, ten billion, twenty-one million, one hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •