Base | Representation |
---|---|
bin | 101111100011011110… |
… | …1101111010101000110 |
3 | 100202121002011102122102 |
4 | 1133012331233111012 |
5 | 3133121303234342 |
6 | 114525255432102 |
7 | 10243454256635 |
oct | 1370675572506 |
9 | 322532142572 |
10 | 102122321222 |
11 | 3a34542a489 |
12 | 17960685632 |
13 | 982641440c |
14 | 4d2ac7b51c |
15 | 29ca710832 |
hex | 17c6f6f546 |
102122321222 has 8 divisors (see below), whose sum is σ = 162194274936. Its totient is φ = 48057562912.
The previous prime is 102122321221. The next prime is 102122321251. The reversal of 102122321222 is 222123221201.
102122321222 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 102122321194 and 102122321203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102122321221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1501798808 + ... + 1501798875.
It is an arithmetic number, because the mean of its divisors is an integer number (20274284367).
Almost surely, 2102122321222 is an apocalyptic number.
102122321222 is a deficient number, since it is larger than the sum of its proper divisors (60071953714).
102122321222 is a wasteful number, since it uses less digits than its factorization.
102122321222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3003597702.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 102122321222 its reverse (222123221201), we get a palindrome (324245542423).
The spelling of 102122321222 in words is "one hundred two billion, one hundred twenty-two million, three hundred twenty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.171 sec. • engine limits •