Base | Representation |
---|---|
bin | 1001001101001100001101… |
… | …1100111110001011100110 |
3 | 1022211200020001200022011002 |
4 | 2103103003130332023212 |
5 | 2311320302324214342 |
6 | 33310030140513302 |
7 | 2063210046146030 |
oct | 223230334761346 |
9 | 38750201608132 |
10 | 10122222101222 |
11 | 32528a0543730 |
12 | 117590784b832 |
13 | 5856a1811b8a |
14 | 26dcbd626c50 |
15 | 12848002dd32 |
hex | 934c373e2e6 |
10122222101222 has 64 divisors (see below), whose sum is σ = 19169582860800. Its totient is φ = 3893907790080.
The previous prime is 10122222101221. The next prime is 10122222101227. The reversal of 10122222101222 is 22210122222101.
It is a super-6 number, since 6×101222221012226 (a number of 79 digits) contains 666666 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10122222101194 and 10122222101203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10122222101221) 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 31 ways as a sum of consecutive naturals, for example, 9196733 + ... + 10238375.
It is an arithmetic number, because the mean of its divisors is an integer number (299524732200).
Almost surely, 210122222101222 is an apocalyptic number.
10122222101222 is a deficient number, since it is larger than the sum of its proper divisors (9047360759578).
10122222101222 is a wasteful number, since it uses less digits than its factorization.
10122222101222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1042461.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 10122222101222 its reverse (22210122222101), we get a palindrome (32332344323323).
The spelling of 10122222101222 in words is "ten trillion, one hundred twenty-two billion, two hundred twenty-two million, one hundred one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •