Base | Representation |
---|---|
bin | 10110110010011010000110… |
… | …011010100111101100001010 |
3 | 111010212000222100012222100121 |
4 | 112302122012122213230022 |
5 | 101114010123113310442 |
6 | 553052522451253454 |
7 | 30052505232214426 |
oct | 2662320632475412 |
9 | 433760870188317 |
10 | 100221022010122 |
11 | 29a2a551193762 |
12 | b2a76095aa28a |
13 | 43bca567b5260 |
14 | 1aa6a1ac15b86 |
15 | b8bea358c967 |
hex | 5b26866a7b0a |
100221022010122 has 16 divisors (see below), whose sum is σ = 162359381053800. Its totient is φ = 46123318037952.
The previous prime is 100221022010111. The next prime is 100221022010141. The reversal of 100221022010122 is 221010220122001.
It is a happy number.
100221022010122 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 52006871673241 + 48214150336881 = 7211579^2 + 6943641^2 .
It is a junction number, because it is equal to n+sod(n) for n = 100221022010096 and 100221022010105.
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 7 ways as a sum of consecutive naturals, for example, 5522418853 + ... + 5522437000.
Almost surely, 2100221022010122 is an apocalyptic number.
100221022010122 is a deficient number, since it is larger than the sum of its proper divisors (62138359043678).
100221022010122 is a wasteful number, since it uses less digits than its factorization.
100221022010122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11044856217.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 100221022010122 its reverse (221010220122001), we get a palindrome (321231242132123).
The spelling of 100221022010122 in words is "one hundred trillion, two hundred twenty-one billion, twenty-two million, ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •