Base | Representation |
---|---|
bin | 101110100100010100… |
… | …1100011010101101101 |
3 | 100120010101110211200000 |
4 | 1131020221203111231 |
5 | 3114301243200023 |
6 | 113535113254513 |
7 | 10140112216305 |
oct | 1351051432555 |
9 | 316111424600 |
10 | 100003100013 |
11 | 394581631a3 |
12 | 1746aa04439 |
13 | 957935677b |
14 | 4ba962a605 |
15 | 290464d243 |
hex | 1748a6356d |
100003100013 has 48 divisors (see below), whose sum is σ = 151110872640. Its totient is φ = 66087010944.
The previous prime is 100003100009. The next prime is 100003100039. The reversal of 100003100013 is 310001300001.
It is not a de Polignac number, because 100003100013 - 22 = 100003100009 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 = 100003099968 and 100003100004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100003100213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 16196995 + ... + 16203167.
It is an arithmetic number, because the mean of its divisors is an integer number (3148143180).
Almost surely, 2100003100013 is an apocalyptic number.
It is an amenable number.
100003100013 is a deficient number, since it is larger than the sum of its proper divisors (51107772627).
100003100013 is an equidigital number, since it uses as much as digits as its factorization.
100003100013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6760 (or 6748 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 9.
Adding to 100003100013 its reverse (310001300001), we get a palindrome (410004400014).
The spelling of 100003100013 in words is "one hundred billion, three million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •