Base | Representation |
---|---|
bin | 1001001100000000111011… |
… | …0101111100010110000101 |
3 | 1022202202001120222222011011 |
4 | 2103000032311330112011 |
5 | 2311002410044231041 |
6 | 33252444510242221 |
7 | 2061563164040410 |
oct | 223001665742605 |
9 | 38682046888134 |
10 | 10102012102021 |
11 | 324526a522154 |
12 | 1171a074b6371 |
13 | 58380078b878 |
14 | 26cd234b8b77 |
15 | 127b9ab30e81 |
hex | 9300ed7c585 |
10102012102021 has 8 divisors (see below), whose sum is σ = 11609654771520. Its totient is φ = 8610493953408.
The previous prime is 10102012102019. The next prime is 10102012102027. The reversal of 10102012102021 is 12020121020101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10102012102021 - 21 = 10102012102019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10102012101992 and 10102012102010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10102012102027) 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, 4031128876 + ... + 4031131381.
It is an arithmetic number, because the mean of its divisors is an integer number (1451206846440).
Almost surely, 210102012102021 is an apocalyptic number.
It is an amenable number.
10102012102021 is a deficient number, since it is larger than the sum of its proper divisors (1507642669499).
10102012102021 is an equidigital number, since it uses as much as digits as its factorization.
10102012102021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8062260443.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10102012102021 its reverse (12020121020101), we get a palindrome (22122133122122).
The spelling of 10102012102021 in words is "ten trillion, one hundred two billion, twelve million, one hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •