Base | Representation |
---|---|
bin | 10110110000110010110010… |
… | …111101100100110100011010 |
3 | 111010110102200000022021022110 |
4 | 112300302302331210310122 |
5 | 101110200441124034320 |
6 | 552525540052333150 |
7 | 30041500415445642 |
oct | 2660626275446432 |
9 | 433412600267273 |
10 | 100110100221210 |
11 | 29997500789a32 |
12 | b28a0120141b6 |
13 | 43b245a333231 |
14 | 1aa14d7443522 |
15 | b891605b25e0 |
hex | 5b0cb2f64d1a |
100110100221210 has 16 divisors (see below), whose sum is σ = 240264240530976. Its totient is φ = 26696026725648.
The previous prime is 100110100221193. The next prime is 100110100221221. The reversal of 100110100221210 is 12122001011001.
100110100221210 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1668501670324 + ... + 1668501670383.
It is an arithmetic number, because the mean of its divisors is an integer number (15016515033186).
Almost surely, 2100110100221210 is an apocalyptic number.
100110100221210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100110100221210 is an abundant number, since it is smaller than the sum of its proper divisors (140154140309766).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100110100221210 is a wasteful number, since it uses less digits than its factorization.
100110100221210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3337003340717.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100110100221210 its reverse (12122001011001), we get a palindrome (112232101232211).
The spelling of 100110100221210 in words is "one hundred trillion, one hundred ten billion, one hundred million, two hundred twenty-one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •