Base | Representation |
---|---|
bin | 101110100100010010… |
… | …1010111000011011001 |
3 | 100120010022102000021000 |
4 | 1131020211113003121 |
5 | 3114301003013423 |
6 | 113535033535213 |
7 | 10140066661440 |
oct | 1351045270331 |
9 | 316108360230 |
10 | 100002001113 |
11 | 39457582613 |
12 | 1746a574509 |
13 | 9579060531 |
14 | 4ba9421d57 |
15 | 29044d2843 |
hex | 17489570d9 |
100002001113 has 32 divisors (see below), whose sum is σ = 169450444800. Its totient is φ = 57098476368.
The previous prime is 100002001111. The next prime is 100002001147. The reversal of 100002001113 is 311100200001.
It is not a de Polignac number, because 100002001113 - 21 = 100002001111 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 100002001095 and 100002001104.
It is not an unprimeable number, because it can be changed into a prime (100002001111) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 27820 + ... + 448082.
It is an arithmetic number, because the mean of its divisors is an integer number (5295326400).
Almost surely, 2100002001113 is an apocalyptic number.
It is an amenable number.
100002001113 is a deficient number, since it is larger than the sum of its proper divisors (69448443687).
100002001113 is a wasteful number, since it uses less digits than its factorization.
100002001113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 421538 (or 421532 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 100002001113 its reverse (311100200001), we get a palindrome (411102201114).
The spelling of 100002001113 in words is "one hundred billion, two million, one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •