Base | Representation |
---|---|
bin | 101111100000001000… |
… | …1101001110111100110 |
3 | 100202022021000001202010 |
4 | 1133000101221313212 |
5 | 3132404041214342 |
6 | 114510210255050 |
7 | 10240622360631 |
oct | 1370021516746 |
9 | 322267001663 |
10 | 102010101222 |
11 | 3a298051987 |
12 | 1792ab87486 |
13 | 98090b2753 |
14 | 4d19dc8c18 |
15 | 29c094529c |
hex | 17c0469de6 |
102010101222 has 8 divisors (see below), whose sum is σ = 204020202456. Its totient is φ = 34003367072.
The previous prime is 102010101217. The next prime is 102010101229. The reversal of 102010101222 is 222101010201.
It is a sphenic number, since it is the product of 3 distinct primes.
102010101222 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 102010101198 and 102010101207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102010101229) 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, 8500841763 + ... + 8500841774.
It is an arithmetic number, because the mean of its divisors is an integer number (25502525307).
Almost surely, 2102010101222 is an apocalyptic number.
102010101222 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102010101222 is a wasteful number, since it uses less digits than its factorization.
102010101222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17001683542.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 102010101222 its reverse (222101010201), we get a palindrome (324111111423).
The spelling of 102010101222 in words is "one hundred two billion, ten million, one hundred one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •