Base | Representation |
---|---|
bin | 10111001100010100110111… |
… | …000000001111010000110101 |
3 | 111101011022020210210102220212 |
4 | 113030110313000033100311 |
5 | 101332200300341401401 |
6 | 1000535041322035205 |
7 | 30325260103656605 |
oct | 2714246700172065 |
9 | 441138223712825 |
10 | 102002101122101 |
11 | 2a556936992104 |
12 | b534835348b05 |
13 | 44bb9aba9bb1b |
14 | 1b28cdc760c05 |
15 | bbd496e86dbb |
hex | 5cc53700f435 |
102002101122101 has 32 divisors (see below), whose sum is σ = 105002728427520. Its totient is φ = 99038772935424.
The previous prime is 102002101122083. The next prime is 102002101122137. The reversal of 102002101122101 is 101221101200201.
It is a cyclic number.
It is not a de Polignac number, because 102002101122101 - 218 = 102002100859957 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 (102002101122001) 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, 11508751196 + ... + 11508760058.
It is an arithmetic number, because the mean of its divisors is an integer number (3281335263360).
Almost surely, 2102002101122101 is an apocalyptic number.
It is an amenable number.
102002101122101 is a deficient number, since it is larger than the sum of its proper divisors (3000627305419).
102002101122101 is a wasteful number, since it uses less digits than its factorization.
102002101122101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12005.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 102002101122101 its reverse (101221101200201), we get a palindrome (203223202322302).
It can be divided in two parts, 10200210 and 1122101, that added together give a palindrome (11322311).
The spelling of 102002101122101 in words is "one hundred two trillion, two billion, one hundred one million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •