Base | Representation |
---|---|
bin | 10111001101110001111001… |
… | …100000000010011001111111 |
3 | 111101111212010000001011100210 |
4 | 113031301321200002121333 |
5 | 101340314344224031421 |
6 | 1001053002311123503 |
7 | 30335424523643235 |
oct | 2715617140023177 |
9 | 441455100034323 |
10 | 102102001002111 |
11 | 2a595240854610 |
12 | b550075673593 |
13 | 44c823c925266 |
14 | 1b2da9839c955 |
15 | bc0d924e6576 |
hex | 5cdc7980267f |
102102001002111 has 16 divisors (see below), whose sum is σ = 149982417318528. Its totient is φ = 61267327332000.
The previous prime is 102102001002091. The next prime is 102102001002161. The reversal of 102102001002111 is 111200100201201.
It is not a de Polignac number, because 102102001002111 - 29 = 102102001001599 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102102001002161) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15316828501 + ... + 15316835166.
It is an arithmetic number, because the mean of its divisors is an integer number (9373901082408).
Almost surely, 2102102001002111 is an apocalyptic number.
102102001002111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
102102001002111 is a deficient number, since it is larger than the sum of its proper divisors (47880416316417).
102102001002111 is a wasteful number, since it uses less digits than its factorization.
102102001002111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30633663782.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 102102001002111 its reverse (111200100201201), we get a palindrome (213302101203312).
The spelling of 102102001002111 in words is "one hundred two trillion, one hundred two billion, one million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •