Base | Representation |
---|---|
bin | 10110111111100001011010… |
… | …000100101111101001011001 |
3 | 111021001012010110111201211200 |
4 | 112333201122010233221121 |
5 | 101223241302112211301 |
6 | 555022523533544413 |
7 | 30204560624062212 |
oct | 2677413204575131 |
9 | 437035113451750 |
10 | 101122221210201 |
11 | 2a2477696932a4 |
12 | b4121b7345109 |
13 | 4456a278456b9 |
14 | 1ad84ad5a0409 |
15 | ba564aee7c86 |
hex | 5bf85a12fa59 |
101122221210201 has 12 divisors (see below), whose sum is σ = 152416101534528. Its totient is φ = 64483735264344.
The previous prime is 101122221210121. The next prime is 101122221210233. The reversal of 101122221210201 is 102012122221101.
101122221210201 is a `hidden beast` number, since 1 + 0 + 11 + 22 + 221 + 210 + 201 = 666.
It is not a de Polignac number, because 101122221210201 - 233 = 101113631275609 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101122221215201) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 244256572765 + ... + 244256573178.
It is an arithmetic number, because the mean of its divisors is an integer number (12701341794544).
Almost surely, 2101122221210201 is an apocalyptic number.
It is an amenable number.
101122221210201 is a deficient number, since it is larger than the sum of its proper divisors (51293880324327).
101122221210201 is a wasteful number, since it uses less digits than its factorization.
101122221210201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 488513145972 (or 488513145969 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 101122221210201 its reverse (102012122221101), we get a palindrome (203134343431302).
The spelling of 101122221210201 in words is "one hundred one trillion, one hundred twenty-two billion, two hundred twenty-one million, two hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •