Base | Representation |
---|---|
bin | 101111101001001001… |
… | …0001001011010001111 |
3 | 100210002022111022012201 |
4 | 1133102102021122033 |
5 | 3134013412022203 |
6 | 115000201542331 |
7 | 10251251344366 |
oct | 1372222113217 |
9 | 323068438181 |
10 | 102312220303 |
11 | 3a432643477 |
12 | 179b41a49a7 |
13 | 9856872c37 |
14 | 4d481907dd |
15 | 29dc221e1d |
hex | 17d248968f |
102312220303 has 4 divisors (see below), whose sum is σ = 104242639608. Its totient is φ = 100381801000.
The previous prime is 102312220271. The next prime is 102312220331. The reversal of 102312220303 is 303022213201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 303022213201 = 269 ⋅1126476629.
It is a cyclic number.
It is not a de Polignac number, because 102312220303 - 25 = 102312220271 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102312220393) 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 3 ways as a sum of consecutive naturals, for example, 965209573 + ... + 965209678.
It is an arithmetic number, because the mean of its divisors is an integer number (26060659902).
Almost surely, 2102312220303 is an apocalyptic number.
102312220303 is a deficient number, since it is larger than the sum of its proper divisors (1930419305).
102312220303 is an equidigital number, since it uses as much as digits as its factorization.
102312220303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1930419304.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 102312220303 its reverse (303022213201), we get a palindrome (405334433504).
The spelling of 102312220303 in words is "one hundred two billion, three hundred twelve million, two hundred twenty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •