Base | Representation |
---|---|
bin | 10111001100011101001010… |
… | …000100110011100110010001 |
3 | 111101012011020202100012201211 |
4 | 113030131022010303212101 |
5 | 101332322022310134301 |
6 | 1000543113404100121 |
7 | 30326023643605042 |
oct | 2714351204634621 |
9 | 441164222305654 |
10 | 102011011021201 |
11 | 2a55a699333187 |
12 | b536501234641 |
13 | 44bc79b993279 |
14 | 1b29505c008c9 |
15 | bbd8192b7051 |
hex | 5cc74a133991 |
102011011021201 has 4 divisors (see below), whose sum is σ = 102025260366400. Its totient is φ = 101996761676004.
The previous prime is 102011011021189. The next prime is 102011011021207. The reversal of 102011011021201 is 102120110110201.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 102011011021201 - 215 = 102011010988433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102011011021207) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7124661861 + ... + 7124676178.
It is an arithmetic number, because the mean of its divisors is an integer number (25506315091600).
Almost surely, 2102011011021201 is an apocalyptic number.
It is an amenable number.
102011011021201 is a deficient number, since it is larger than the sum of its proper divisors (14249345199).
102011011021201 is an equidigital number, since it uses as much as digits as its factorization.
102011011021201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14249345198.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 102011011021201 its reverse (102120110110201), we get a palindrome (204131121131402).
The spelling of 102011011021201 in words is "one hundred two trillion, eleven billion, eleven million, twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •