Base | Representation |
---|---|
bin | 101111111110000000… |
… | …0010110111100010101 |
3 | 100211220002121222010120 |
4 | 1133330000112330111 |
5 | 3141432110401323 |
6 | 115153444542153 |
7 | 10304511153216 |
oct | 1377400267425 |
9 | 324802558116 |
10 | 103012200213 |
11 | 3a76177976a |
12 | 17b6a6b1959 |
13 | 99388a6130 |
14 | 4db312140d |
15 | 2a2d8dd5e3 |
hex | 17fc016f15 |
103012200213 has 32 divisors (see below), whose sum is σ = 158052787200. Its totient is φ = 59115764736.
The previous prime is 103012200211. The next prime is 103012200217. The reversal of 103012200213 is 312002210301.
It is not a de Polignac number, because 103012200213 - 21 = 103012200211 is a prime.
It is a super-2 number, since 2×1030122002132 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103012200192 and 103012200201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103012200211) 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, 640453 + ... + 784986.
It is an arithmetic number, because the mean of its divisors is an integer number (4939149600).
Almost surely, 2103012200213 is an apocalyptic number.
103012200213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
103012200213 is a deficient number, since it is larger than the sum of its proper divisors (55040586987).
103012200213 is a wasteful number, since it uses less digits than its factorization.
103012200213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1425581.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 103012200213 its reverse (312002210301), we get a palindrome (415014410514).
The spelling of 103012200213 in words is "one hundred three billion, twelve million, two hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •