Base | Representation |
---|---|
bin | 10110101111001110001000… |
… | …010110110000111111111010 |
3 | 111010002002200002210012012210 |
4 | 112233032020112300333322 |
5 | 101101413104333101020 |
6 | 552404142330115550 |
7 | 30030623030223252 |
oct | 2657161026607772 |
9 | 433062602705183 |
10 | 100002011222010 |
11 | 29955684319027 |
12 | b27108727bbb6 |
13 | 43a51c2a1c141 |
14 | 1a9a1a1d8c962 |
15 | b8643614c3e0 |
hex | 5af3885b0ffa |
100002011222010 has 16 divisors (see below), whose sum is σ = 240004826932896. Its totient is φ = 26667202992528.
The previous prime is 100002011221997. The next prime is 100002011222011. The reversal of 100002011222010 is 10222110200001.
It is not an unprimeable number, because it can be changed into a prime (100002011222011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1666700187004 + ... + 1666700187063.
It is an arithmetic number, because the mean of its divisors is an integer number (15000301683306).
Almost surely, 2100002011222010 is an apocalyptic number.
100002011222010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100002011222010 is an abundant number, since it is smaller than the sum of its proper divisors (140002815710886).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100002011222010 is a wasteful number, since it uses less digits than its factorization.
100002011222010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3333400374077.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 100002011222010 its reverse (10222110200001), we get a palindrome (110224121422011).
It can be divided in two parts, 10000201 and 1222010, that added together give a palindrome (11222211).
The spelling of 100002011222010 in words is "one hundred trillion, two billion, eleven million, two hundred twenty-two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •