Base | Representation |
---|---|
bin | 110000000110101001… |
… | …0101010111001011101 |
3 | 100212122022100011011210 |
4 | 1200031102222321131 |
5 | 3143030331310323 |
6 | 115242324535033 |
7 | 10314632216163 |
oct | 1401522527135 |
9 | 325568304153 |
10 | 103302213213 |
11 | 3a8a0451831 |
12 | 1802b851479 |
13 | 99839b8264 |
14 | 4ddd855233 |
15 | 2a490c8293 |
hex | 180d4aae5d |
103302213213 has 8 divisors (see below), whose sum is σ = 137748564928. Its totient is φ = 68862001824.
The previous prime is 103302213197. The next prime is 103302213221. The reversal of 103302213213 is 312312203301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103302213213 - 24 = 103302213197 is a prime.
It is a super-2 number, since 2×1033022132132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103302213213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103302213263) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1495681 + ... + 1563222.
It is an arithmetic number, because the mean of its divisors is an integer number (17218570616).
Almost surely, 2103302213213 is an apocalyptic number.
It is an amenable number.
103302213213 is a deficient number, since it is larger than the sum of its proper divisors (34446351715).
103302213213 is a wasteful number, since it uses less digits than its factorization.
103302213213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3070163.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 103302213213 its reverse (312312203301), we get a palindrome (415614416514).
The spelling of 103302213213 in words is "one hundred three billion, three hundred two million, two hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •