Base | Representation |
---|---|
bin | 10111001100011101010000… |
… | …000010111101100101100001 |
3 | 111101012011111201211212202020 |
4 | 113030131100002331211201 |
5 | 101332322223431413441 |
6 | 1000543131343212053 |
7 | 30326026301246553 |
oct | 2714352002754541 |
9 | 441164451755666 |
10 | 102011111201121 |
11 | 2a55a73a937901 |
12 | b53652a8a7029 |
13 | 44bc7b666a925 |
14 | 1b2951523b4d3 |
15 | bbd822ea4e66 |
hex | 5cc7500bd961 |
102011111201121 has 8 divisors (see below), whose sum is σ = 136993338783840. Its totient is φ = 67518145542912.
The previous prime is 102011111201113. The next prime is 102011111201147. The reversal of 102011111201121 is 121102111110201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102011111201121 - 23 = 102011111201113 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102011111201121.
It is not an unprimeable number, because it can be changed into a prime (102011111201161) 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, 122315480640 + ... + 122315481473.
It is an arithmetic number, because the mean of its divisors is an integer number (17124167347980).
Almost surely, 2102011111201121 is an apocalyptic number.
It is an amenable number.
102011111201121 is a deficient number, since it is larger than the sum of its proper divisors (34982227582719).
102011111201121 is a wasteful number, since it uses less digits than its factorization.
102011111201121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 244630962255.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 102011111201121 its reverse (121102111110201), we get a palindrome (223113222311322).
The spelling of 102011111201121 in words is "one hundred two trillion, eleven billion, one hundred eleven million, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •