Base | Representation |
---|---|
bin | 110000011000111000… |
… | …0000110111011110001 |
3 | 100221012221100120102101 |
4 | 1200301300012323301 |
5 | 3200303430110001 |
6 | 115423135420401 |
7 | 10336040442556 |
oct | 1406160067361 |
9 | 327187316371 |
10 | 103913910001 |
11 | 40084769670 |
12 | 18180684701 |
13 | 9a5064ab15 |
14 | 505aba4a2d |
15 | 2a82b56a01 |
hex | 1831c06ef1 |
103913910001 has 16 divisors (see below), whose sum is σ = 118329176448. Its totient is φ = 90329500800.
The previous prime is 103913909993. The next prime is 103913910013. The reversal of 103913910001 is 100019319301.
It is not a de Polignac number, because 103913910001 - 23 = 103913909993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103913910041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 700741 + ... + 835981.
It is an arithmetic number, because the mean of its divisors is an integer number (7395573528).
Almost surely, 2103913910001 is an apocalyptic number.
103913910001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
103913910001 is a deficient number, since it is larger than the sum of its proper divisors (14415266447).
103913910001 is a wasteful number, since it uses less digits than its factorization.
103913910001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138312.
The product of its (nonzero) digits is 729, while the sum is 28.
The spelling of 103913910001 in words is "one hundred three billion, nine hundred thirteen million, nine hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •