Base | Representation |
---|---|
bin | 10111001100011110000101… |
… | …000101101111001101010111 |
3 | 111101012020210202101111110212 |
4 | 113030132011011233031113 |
5 | 101332331034241333421 |
6 | 1000543355533240035 |
7 | 30326060325403514 |
oct | 2714360505571527 |
9 | 441166722344425 |
10 | 102012001121111 |
11 | 2a560057204974 |
12 | b53673893301b |
13 | 44bc8c8b451c3 |
14 | 1b2959b4d230b |
15 | bbd87618ee5b |
hex | 5cc78516f357 |
102012001121111 has 8 divisors (see below), whose sum is σ = 102019944618144. Its totient is φ = 102004057971360.
The previous prime is 102012001121101. The next prime is 102012001121137. The reversal of 102012001121111 is 111121100210201.
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 102012001121111 - 230 = 102010927379287 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 (102012001121101) 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, 929719025 + ... + 929828741.
It is an arithmetic number, because the mean of its divisors is an integer number (12752493077268).
Almost surely, 2102012001121111 is an apocalyptic number.
102012001121111 is a deficient number, since it is larger than the sum of its proper divisors (7943497033).
102012001121111 is a wasteful number, since it uses less digits than its factorization.
102012001121111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 173641.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 102012001121111 its reverse (111121100210201), we get a palindrome (213133101331312).
It can be divided in two parts, 10201200 and 1121111, that added together give a palindrome (11322311).
The spelling of 102012001121111 in words is "one hundred two trillion, twelve billion, one million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •