Base | Representation |
---|---|
bin | 10111001100011110000101… |
… | …000001110110011011011111 |
3 | 111101012020210200110201200010 |
4 | 113030132011001312123133 |
5 | 101332331034011231421 |
6 | 1000543355455334303 |
7 | 30326060313630621 |
oct | 2714360501663337 |
9 | 441166720421603 |
10 | 102012000102111 |
11 | 2a560056679320 |
12 | b536738521393 |
13 | 44bc8c8879448 |
14 | 1b2959b308c11 |
15 | bbd87603d076 |
hex | 5cc7850766df |
102012000102111 has 8 divisors (see below), whose sum is σ = 148381091057664. Its totient is φ = 61825454607320.
The previous prime is 102012000102029. The next prime is 102012000102121. The reversal of 102012000102111 is 111201000210201.
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 102012000102111 - 225 = 102011966547679 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102012000102121) 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, 1545636365151 + ... + 1545636365216.
It is an arithmetic number, because the mean of its divisors is an integer number (18547636382208).
Almost surely, 2102012000102111 is an apocalyptic number.
102012000102111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
102012000102111 is a deficient number, since it is larger than the sum of its proper divisors (46369090955553).
102012000102111 is a wasteful number, since it uses less digits than its factorization.
102012000102111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3091272730381.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 102012000102111 its reverse (111201000210201), we get a palindrome (213213000312312).
The spelling of 102012000102111 in words is "one hundred two trillion, twelve billion, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •