Base | Representation |
---|---|
bin | 10111001101110001000100… |
… | …100001100001111111110001 |
3 | 111101111202211001121101201120 |
4 | 113031301010201201333301 |
5 | 101340311034210414301 |
6 | 1001052334201052453 |
7 | 30335363512160031 |
oct | 2715610441417761 |
9 | 441452731541646 |
10 | 102101112201201 |
11 | 2a594925081303 |
12 | b54ba67a87129 |
13 | 44c812a750169 |
14 | 1b2da123198c1 |
15 | bc0d3e47ce36 |
hex | 5cdc44861ff1 |
102101112201201 has 8 divisors (see below), whose sum is σ = 136139402676000. Its totient is φ = 68065114930272.
The previous prime is 102101112201181. The next prime is 102101112201229. The reversal of 102101112201201 is 102102211101201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102101112201201 - 25 = 102101112201169 is a prime.
It is a super-2 number, since 2×1021011122012012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102101112201241) 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, 573197076 + ... + 573375173.
It is an arithmetic number, because the mean of its divisors is an integer number (17017425334500).
Almost surely, 2102101112201201 is an apocalyptic number.
It is an amenable number.
102101112201201 is a deficient number, since it is larger than the sum of its proper divisors (34038290474799).
102101112201201 is a wasteful number, since it uses less digits than its factorization.
102101112201201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1146601935.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 102101112201201 its reverse (102102211101201), we get a palindrome (204203323302402).
The spelling of 102101112201201 in words is "one hundred two trillion, one hundred one billion, one hundred twelve million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •