Base | Representation |
---|---|
bin | 101111111110010011… |
… | …1000011010000101101 |
3 | 100211220210201021201020 |
4 | 1133330213003100231 |
5 | 3141442204440323 |
6 | 115154450204353 |
7 | 10304663316516 |
oct | 1377447032055 |
9 | 324823637636 |
10 | 103022343213 |
11 | 3a767477309 |
12 | 17b71b836b9 |
13 | 993aa17aca |
14 | 4db4601a0d |
15 | 2a2e743ae3 |
hex | 17fc9c342d |
103022343213 has 4 divisors (see below), whose sum is σ = 137363124288. Its totient is φ = 68681562140.
The previous prime is 103022343181. The next prime is 103022343227. The reversal of 103022343213 is 312343220301.
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 103022343213 - 25 = 103022343181 is a prime.
It is a super-2 number, since 2×1030223432132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103022343713) 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, 17170390533 + ... + 17170390538.
It is an arithmetic number, because the mean of its divisors is an integer number (34340781072).
Almost surely, 2103022343213 is an apocalyptic number.
It is an amenable number.
103022343213 is a deficient number, since it is larger than the sum of its proper divisors (34340781075).
103022343213 is an equidigital number, since it uses as much as digits as its factorization.
103022343213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34340781074.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 103022343213 its reverse (312343220301), we get a palindrome (415365563514).
The spelling of 103022343213 in words is "one hundred three billion, twenty-two million, three hundred forty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •