Base | Representation |
---|---|
bin | 101110111111011000… |
… | …0111101000011010010 |
3 | 100122110122212110000220 |
4 | 1131332300331003102 |
5 | 3123131204310002 |
6 | 114205145053510 |
7 | 10201445301225 |
oct | 1357660750322 |
9 | 318418773026 |
10 | 100911010002 |
11 | 398836a8430 |
12 | 17682a87296 |
13 | 969248c60a |
14 | 4c540455bc |
15 | 29591dd7bc |
hex | 177ec3d0d2 |
100911010002 has 64 divisors (see below), whose sum is σ = 225228570624. Its totient is φ = 29878611840.
The previous prime is 100911009973. The next prime is 100911010061. The reversal of 100911010002 is 200010119001.
100911010002 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1856118 + ... + 1909710.
It is an arithmetic number, because the mean of its divisors is an integer number (3519196416).
Almost surely, 2100911010002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 100911010002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (112614285312).
100911010002 is an abundant number, since it is smaller than the sum of its proper divisors (124317560622).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100911010002 is a wasteful number, since it uses less digits than its factorization.
100911010002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54263.
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 100911010002 its reverse (200010119001), we get a palindrome (300921129003).
It can be divided in two parts, 1009 and 11010002, that added together give a palindrome (11011011).
The spelling of 100911010002 in words is "one hundred billion, nine hundred eleven million, ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •