Base | Representation |
---|---|
bin | 101111100000100000… |
… | …0110100001100110111 |
3 | 100202100010021011201022 |
4 | 1133001000310030313 |
5 | 3132420222324221 |
6 | 114511331251355 |
7 | 10241132431625 |
oct | 1370100641467 |
9 | 322303234638 |
10 | 102022464311 |
11 | 3a2a4026509 |
12 | 17933149b5b |
13 | 980b820aa1 |
14 | 4d1b8c6515 |
15 | 29c1a884ab |
hex | 17c1034337 |
102022464311 has 4 divisors (see below), whose sum is σ = 103251650712. Its totient is φ = 100793277912.
The previous prime is 102022464289. The next prime is 102022464317. The reversal of 102022464311 is 113464220201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 113464220201 = 563 ⋅201535027.
It is a cyclic number.
It is not a de Polignac number, because 102022464311 - 234 = 84842595127 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 (102022464317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 614593076 + ... + 614593241.
It is an arithmetic number, because the mean of its divisors is an integer number (25812912678).
Almost surely, 2102022464311 is an apocalyptic number.
102022464311 is a deficient number, since it is larger than the sum of its proper divisors (1229186401).
102022464311 is an equidigital number, since it uses as much as digits as its factorization.
102022464311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1229186400.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 102022464311 its reverse (113464220201), we get a palindrome (215486684512).
The spelling of 102022464311 in words is "one hundred two billion, twenty-two million, four hundred sixty-four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •