Base | Representation |
---|---|
bin | 11000011001101001… |
… | …11010100110100011 |
3 | 1020210222011000212000 |
4 | 30030310322212203 |
5 | 203312111200003 |
6 | 10003524335043 |
7 | 642430004244 |
oct | 141464724643 |
9 | 36728130760 |
10 | 13100100003 |
11 | 5612735031 |
12 | 2657244483 |
13 | 130a04bb83 |
14 | 8c3b84ccb |
15 | 51a1261a3 |
hex | 30cd3a9a3 |
13100100003 has 16 divisors (see below), whose sum is σ = 19410156960. Its totient is φ = 8732229408.
The previous prime is 13100099981. The next prime is 13100100017. The reversal of 13100100003 is 30000100131.
13100100003 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13100100003 - 212 = 13100095907 is a prime.
It is a super-2 number, since 2×131001000032 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (13100000003) 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, 203901 + ... + 260337.
It is an arithmetic number, because the mean of its divisors is an integer number (1213134810).
Almost surely, 213100100003 is an apocalyptic number.
13100100003 is a deficient number, since it is larger than the sum of its proper divisors (6310056957).
13100100003 is an equidigital number, since it uses as much as digits as its factorization.
13100100003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65043 (or 65037 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 9.
Adding to 13100100003 its reverse (30000100131), we get a palindrome (43100200134).
The spelling of 13100100003 in words is "thirteen billion, one hundred million, one hundred thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •