Base | Representation |
---|---|
bin | 10110101111001101010010… |
… | …101000111011000001100010 |
3 | 111010002000100021222222111100 |
4 | 112233031102220323001202 |
5 | 101101404233130341002 |
6 | 552403513054055230 |
7 | 30030561505114653 |
oct | 2657152250730142 |
9 | 433060307888440 |
10 | 100001110012002 |
11 | 2995526163a671 |
12 | b270a754aa516 |
13 | 43a50ab0c0a94 |
14 | 1a9a1183d952a |
15 | b863d1e8211c |
hex | 5af352a3b062 |
100001110012002 has 24 divisors (see below), whose sum is σ = 218103966213120. Its totient is φ = 33112950334200.
The previous prime is 100001110011917. The next prime is 100001110012057. The reversal of 100001110012002 is 200210011100001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 18396080802 + ... + 18396086237.
It is an arithmetic number, because the mean of its divisors is an integer number (9087665258880).
Almost surely, 2100001110012002 is an apocalyptic number.
100001110012002 is an abundant number, since it is smaller than the sum of its proper divisors (118102856201118).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100001110012002 is a wasteful number, since it uses less digits than its factorization.
100001110012002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36792167198 (or 36792167195 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 100001110012002 its reverse (200210011100001), we get a palindrome (300211121112003).
The spelling of 100001110012002 in words is "one hundred trillion, one billion, one hundred ten million, twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •