Base | Representation |
---|---|
bin | 1001000110000110000110… |
… | …0110000001101000110110 |
3 | 1022102000120120200002020202 |
4 | 2101201201212001220312 |
5 | 2302321124213120342 |
6 | 33134030102000502 |
7 | 2051333165606201 |
oct | 221414146015066 |
9 | 38360516602222 |
10 | 10000321223222 |
11 | 3206126693860 |
12 | 1156167416132 |
13 | 577045877435 |
14 | 268037a68938 |
15 | 1251e8245332 |
hex | 91861981a36 |
10000321223222 has 16 divisors (see below), whose sum is σ = 16365693034944. Its totient is φ = 4545175269000.
The previous prime is 10000321223209. The next prime is 10000321223227. The reversal of 10000321223222 is 22232212300001.
It is a happy number.
It is a super-2 number, since 2×100003212232222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10000321223194 and 10000321223203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10000321223227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21023804 + ... + 21494207.
It is an arithmetic number, because the mean of its divisors is an integer number (1022855814684).
Almost surely, 210000321223222 is an apocalyptic number.
10000321223222 is a deficient number, since it is larger than the sum of its proper divisors (6365371811722).
10000321223222 is a wasteful number, since it uses less digits than its factorization.
10000321223222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42528715.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 10000321223222 its reverse (22232212300001), we get a palindrome (32232533523223).
The spelling of 10000321223222 in words is "ten trillion, three hundred twenty-one million, two hundred twenty-three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •