Base | Representation |
---|---|
bin | 1001001101001011110011… |
… | …0101001010011001101110 |
3 | 1022211122221022121212222022 |
4 | 2103102330311022121232 |
5 | 2311320040404032342 |
6 | 33310011131350142 |
7 | 2063204226626162 |
oct | 223227465123156 |
9 | 38748838555868 |
10 | 10122111002222 |
11 | 325284386137a |
12 | 11758965b2352 |
13 | 5856847b351b |
14 | 26dcac986ca2 |
15 | 1284753d59d2 |
hex | 934bcd4a66e |
10122111002222 has 8 divisors (see below), whose sum is σ = 15183333180696. Its totient is φ = 5060999941992.
The previous prime is 10122111002197. The next prime is 10122111002291. The reversal of 10122111002222 is 22220011122101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×101221110022222 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10122111002222.
It is a congruent number.
It is an unprimeable number.
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, 27551453 + ... + 27916424.
It is an arithmetic number, because the mean of its divisors is an integer number (1897916647587).
Almost surely, 210122111002222 is an apocalyptic number.
10122111002222 is a deficient number, since it is larger than the sum of its proper divisors (5061222178474).
10122111002222 is an equidigital number, since it uses as much as digits as its factorization.
10122111002222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55559122.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 10122111002222 its reverse (22220011122101), we get a palindrome (32342122124323).
The spelling of 10122111002222 in words is "ten trillion, one hundred twenty-two billion, one hundred eleven million, two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •