Base | Representation |
---|---|
bin | 10110110010000110101110… |
… | …100010100000110100100101 |
3 | 111010210001021122012012111200 |
4 | 112302012232202200310211 |
5 | 101113140022401100201 |
6 | 553035202403153113 |
7 | 30051140603652456 |
oct | 2662065642406445 |
9 | 433701248165450 |
10 | 100200220331301 |
11 | 29a21747187562 |
12 | b2a3583075799 |
13 | 43baabccba56c |
14 | 1aa5a0628912d |
15 | b8b687267386 |
hex | 5b21ae8a0d25 |
100200220331301 has 24 divisors (see below), whose sum is σ = 145534480116480. Its totient is φ = 66430539784800.
The previous prime is 100200220331297. The next prime is 100200220331369. The reversal of 100200220331301 is 103133022002001.
100200220331301 is a `hidden beast` number, since 10 + 0 + 2 + 0 + 0 + 2 + 20 + 331 + 301 = 666.
It is not a de Polignac number, because 100200220331301 - 22 = 100200220331297 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100200220332301) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 333584740 + ... + 333884978.
It is an arithmetic number, because the mean of its divisors is an integer number (6063936671520).
Almost surely, 2100200220331301 is an apocalyptic number.
It is an amenable number.
100200220331301 is a deficient number, since it is larger than the sum of its proper divisors (45334259785179).
100200220331301 is a wasteful number, since it uses less digits than its factorization.
100200220331301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 505297 (or 505294 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 100200220331301 its reverse (103133022002001), we get a palindrome (203333242333302).
The spelling of 100200220331301 in words is "one hundred trillion, two hundred billion, two hundred twenty million, three hundred thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •