Base | Representation |
---|---|
bin | 101111101001000111… |
… | …0010101100001001011 |
3 | 100210002020121112212110 |
4 | 1133102032111201023 |
5 | 3134013133040243 |
6 | 115000124313403 |
7 | 10251240014043 |
oct | 1372216254113 |
9 | 323066545773 |
10 | 102311221323 |
11 | 3a432020973 |
12 | 179b39a2863 |
13 | 98565b331c |
14 | 4d47db0723 |
15 | 29dc0c5e33 |
hex | 17d239584b |
102311221323 has 16 divisors (see below), whose sum is σ = 140157279360. Its totient is φ = 66360158976.
The previous prime is 102311221303. The next prime is 102311221343. The reversal of 102311221323 is 323122113201.
It is an interprime number because it is at equal distance from previous prime (102311221303) and next prime (102311221343).
It is not a de Polignac number, because 102311221323 - 224 = 102294444107 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102311221323.
It is not an unprimeable number, because it can be changed into a prime (102311221303) 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 15 ways as a sum of consecutive naturals, for example, 2962365 + ... + 2996702.
It is an arithmetic number, because the mean of its divisors is an integer number (8759829960).
Almost surely, 2102311221323 is an apocalyptic number.
102311221323 is a deficient number, since it is larger than the sum of its proper divisors (37846058037).
102311221323 is an equidigital number, since it uses as much as digits as its factorization.
102311221323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5959226.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 102311221323 its reverse (323122113201), we get a palindrome (425433334524).
The spelling of 102311221323 in words is "one hundred two billion, three hundred eleven million, two hundred twenty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •