Base | Representation |
---|---|
bin | 10111001110000010110000… |
… | …111100001111000011010001 |
3 | 111101120120212010012212211202 |
4 | 113032002300330033003101 |
5 | 101341113441404310001 |
6 | 1001105155323320545 |
7 | 30336635356322120 |
oct | 2716026074170321 |
9 | 441516763185752 |
10 | 102120111010001 |
11 | 2a5a1994443587 |
12 | b55368a680155 |
13 | 44c9b67891666 |
14 | 1b308d5663ab7 |
15 | bc15a237e96b |
hex | 5ce0b0f0f0d1 |
102120111010001 has 8 divisors (see below), whose sum is σ = 116708763674880. Its totient is φ = 87531474689568.
The previous prime is 102120111009827. The next prime is 102120111010007. The reversal of 102120111010001 is 100010111021201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102120111010001 - 226 = 102120043901137 is a prime.
It is a super-3 number, since 3×1021201110100013 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102120111010007) 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, 15671285 + ... + 21209181.
It is an arithmetic number, because the mean of its divisors is an integer number (14588595459360).
Almost surely, 2102120111010001 is an apocalyptic number.
It is an amenable number.
102120111010001 is a deficient number, since it is larger than the sum of its proper divisors (14588652664879).
102120111010001 is an equidigital number, since it uses as much as digits as its factorization.
102120111010001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8172223.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 102120111010001 its reverse (100010111021201), we get a palindrome (202130222031202).
The spelling of 102120111010001 in words is "one hundred two trillion, one hundred twenty billion, one hundred eleven million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •