Base | Representation |
---|---|
bin | 10110110010011001001111… |
… | …100010000000100010001010 |
3 | 111010211221121011112222100101 |
4 | 112302121033202000202022 |
5 | 101114001231401400020 |
6 | 553052251235200014 |
7 | 30052443351364021 |
oct | 2662311742004212 |
9 | 433757534488311 |
10 | 100220101200010 |
11 | 29a2a119438470 |
12 | b2a73b114600a |
13 | 43bc93aab37bc |
14 | 1aa69707dd8b8 |
15 | b8be4c80000a |
hex | 5b264f88088a |
100220101200010 has 64 divisors (see below), whose sum is σ = 196989339778560. Its totient is φ = 36407848596480.
The previous prime is 100220101200007. The next prime is 100220101200031. The reversal of 100220101200010 is 10002101022001.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a self number, because there is not a number n which added to its sum of digits gives 100220101200010.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 890322111 + ... + 890434669.
It is an arithmetic number, because the mean of its divisors is an integer number (3077958434040).
Almost surely, 2100220101200010 is an apocalyptic number.
100220101200010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100220101200010 is a deficient number, since it is larger than the sum of its proper divisors (96769238578550).
100220101200010 is a wasteful number, since it uses less digits than its factorization.
100220101200010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120463.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 100220101200010 its reverse (10002101022001), we get a palindrome (110222202222011).
The spelling of 100220101200010 in words is "one hundred trillion, two hundred twenty billion, one hundred one million, two hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •