Base | Representation |
---|---|
bin | 101111100010110100… |
… | …0100110000011110101 |
3 | 100202112112011110002000 |
4 | 1133011220212003311 |
5 | 3133100100013023 |
6 | 114523141205513 |
7 | 10243063455303 |
oct | 1370550460365 |
9 | 322475143060 |
10 | 102100001013 |
11 | 3a333874a2a |
12 | 17955100899 |
13 | 98218cabaa |
14 | 4d27d0b273 |
15 | 29c87a2243 |
hex | 17c5a260f5 |
102100001013 has 16 divisors (see below), whose sum is σ = 152646964800. Its totient is φ = 67442200560.
The previous prime is 102100000979. The next prime is 102100001027. The reversal of 102100001013 is 310100001201.
It is not a de Polignac number, because 102100001013 - 213 = 102099992821 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 = 102100000986 and 102100001004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102100001713) 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 15 ways as a sum of consecutive naturals, for example, 17343303 + ... + 17349188.
It is an arithmetic number, because the mean of its divisors is an integer number (9540435300).
Almost surely, 2102100001013 is an apocalyptic number.
It is an amenable number.
102100001013 is a deficient number, since it is larger than the sum of its proper divisors (50546963787).
102100001013 is a wasteful number, since it uses less digits than its factorization.
102100001013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34692609 (or 34692603 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 102100001013 its reverse (310100001201), we get a palindrome (412200002214).
The spelling of 102100001013 in words is "one hundred two billion, one hundred million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •