Base | Representation |
---|---|
bin | 10110111110000011010101… |
… | …010101111100100011111101 |
3 | 111020200112101211021202220120 |
4 | 112332003111111330203331 |
5 | 101220112414241231023 |
6 | 554504300411205153 |
7 | 30164353521606345 |
oct | 2676032525744375 |
9 | 436615354252816 |
10 | 101021210102013 |
11 | 2a2089445376a3 |
12 | b3b6706a467b9 |
13 | 444a34a7099b6 |
14 | 1ad364a13dd25 |
15 | ba2bd81358e3 |
hex | 5be0d557c8fd |
101021210102013 has 8 divisors (see below), whose sum is σ = 137560796734848. Its totient is φ = 65914548435264.
The previous prime is 101021210101997. The next prime is 101021210102053. The reversal of 101021210102013 is 310201012120101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101021210102013 - 24 = 101021210101997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101021210101983 and 101021210102001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101021210102053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 358231241356 + ... + 358231241637.
It is an arithmetic number, because the mean of its divisors is an integer number (17195099591856).
Almost surely, 2101021210102013 is an apocalyptic number.
It is an amenable number.
101021210102013 is a deficient number, since it is larger than the sum of its proper divisors (36539586632835).
101021210102013 is an equidigital number, since it uses as much as digits as its factorization.
101021210102013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 716462483043.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 101021210102013 its reverse (310201012120101), we get a palindrome (411222222222114).
The spelling of 101021210102013 in words is "one hundred one trillion, twenty-one billion, two hundred ten million, one hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •