Base | Representation |
---|---|
bin | 11011010011101100110010… |
… | …101000111110011001111110 |
3 | 120202020112201120220211121212 |
4 | 123103230302220332121332 |
5 | 111220213342121201342 |
6 | 1103233351424124422 |
7 | 34204004144650610 |
oct | 3323546250763176 |
9 | 522215646824555 |
10 | 120101020100222 |
11 | 352a4613901747 |
12 | 11578470766712 |
13 | 52026293934c5 |
14 | 2192cc5790db0 |
15 | dd41831e2182 |
hex | 6d3b32a3e67e |
120101020100222 has 16 divisors (see below), whose sum is σ = 208493633448960. Its totient is φ = 50820323152248.
The previous prime is 120101020100221. The next prime is 120101020100249. The reversal of 120101020100222 is 222001020101021.
It is a super-2 number, since 2×1201010201002222 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 120101020100197 and 120101020100206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120101020100221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54295215938 + ... + 54295218149.
It is an arithmetic number, because the mean of its divisors is an integer number (13030852090560).
Almost surely, 2120101020100222 is an apocalyptic number.
120101020100222 is a deficient number, since it is larger than the sum of its proper divisors (88392613348738).
120101020100222 is a wasteful number, since it uses less digits than its factorization.
120101020100222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 108590434175.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 120101020100222 its reverse (222001020101021), we get a palindrome (342102040201243).
The spelling of 120101020100222 in words is "one hundred twenty trillion, one hundred one billion, twenty million, one hundred thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •