Base | Representation |
---|---|
bin | 110000000011111110… |
… | …0010001101011001101 |
3 | 100212102001110001022202 |
4 | 1200013330101223031 |
5 | 3142334342103103 |
6 | 115225401051245 |
7 | 10312462256225 |
oct | 1400774215315 |
9 | 325361401282 |
10 | 103212456653 |
11 | 3a854817359 |
12 | 18005786b25 |
13 | 996b220077 |
14 | 4dd196d085 |
15 | 2a41298988 |
hex | 1807f11acd |
103212456653 has 4 divisors (see below), whose sum is σ = 103895983008. Its totient is φ = 102528930300.
The previous prime is 103212456623. The next prime is 103212456667. The reversal of 103212456653 is 356654212301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 103212456653 - 28 = 103212456397 is a prime.
It is a super-2 number, since 2×1032124566532 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103212456623) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 341762951 + ... + 341763252.
It is an arithmetic number, because the mean of its divisors is an integer number (25973995752).
Almost surely, 2103212456653 is an apocalyptic number.
It is an amenable number.
103212456653 is a deficient number, since it is larger than the sum of its proper divisors (683526355).
103212456653 is an equidigital number, since it uses as much as digits as its factorization.
103212456653 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 683526354.
The product of its (nonzero) digits is 129600, while the sum is 38.
Adding to 103212456653 its reverse (356654212301), we get a palindrome (459866668954).
The spelling of 103212456653 in words is "one hundred three billion, two hundred twelve million, four hundred fifty-six thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.209 sec. • engine limits •