Base | Representation |
---|---|
bin | 10111001100100110101010… |
… | …000011000011101100111001 |
3 | 111101020010120121121102100220 |
4 | 113030212222003003230321 |
5 | 101333003420021011301 |
6 | 1000551521455250253 |
7 | 30326534501124615 |
oct | 2714465203035471 |
9 | 441203517542326 |
10 | 102021211110201 |
11 | 2a563a52a90aa9 |
12 | b538489219989 |
13 | 44c0735c693a6 |
14 | 1b29bd276a345 |
15 | bbdc149ea936 |
hex | 5cc9aa0c3b39 |
102021211110201 has 8 divisors (see below), whose sum is σ = 136072317841440. Its totient is φ = 67992122559552.
The previous prime is 102021211110197. The next prime is 102021211110253. The reversal of 102021211110201 is 102011112120201.
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 102021211110201 - 22 = 102021211110197 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102021211110901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5504534335 + ... + 5504552868.
It is an arithmetic number, because the mean of its divisors is an integer number (17009039730180).
Almost surely, 2102021211110201 is an apocalyptic number.
It is an amenable number.
102021211110201 is a deficient number, since it is larger than the sum of its proper divisors (34051106731239).
102021211110201 is a wasteful number, since it uses less digits than its factorization.
102021211110201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11009090295.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 102021211110201 its reverse (102011112120201), we get a palindrome (204032323230402).
The spelling of 102021211110201 in words is "one hundred two trillion, twenty-one billion, two hundred eleven million, one hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •