Base | Representation |
---|---|
bin | 101111100000011101… |
… | …1101110111110111111 |
3 | 100202100000202111102201 |
4 | 1133000323232332333 |
5 | 3132414402212343 |
6 | 114511242532331 |
7 | 10241115213163 |
oct | 1370073567677 |
9 | 322300674381 |
10 | 102021132223 |
11 | 3a2a32a670a |
12 | 179328070a7 |
13 | 980b47567a |
14 | 4d1b65aca3 |
15 | 29c18c394d |
hex | 17c0eeefbf |
102021132223 has 8 divisors (see below), whose sum is σ = 107804390400. Its totient is φ = 96350170488.
The previous prime is 102021132221. The next prime is 102021132229. The reversal of 102021132223 is 322231120201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102021132223 - 21 = 102021132221 is a prime.
It is a super-2 number, since 2×1020211322232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102021132223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102021132221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28072243 + ... + 28075876.
It is an arithmetic number, because the mean of its divisors is an integer number (13475548800).
Almost surely, 2102021132223 is an apocalyptic number.
102021132223 is a deficient number, since it is larger than the sum of its proper divisors (5783258177).
102021132223 is an equidigital number, since it uses as much as digits as its factorization.
102021132223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56148221.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 102021132223 its reverse (322231120201), we get a palindrome (424252252424).
The spelling of 102021132223 in words is "one hundred two billion, twenty-one million, one hundred thirty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •