Base | Representation |
---|---|
bin | 11101011101011010001… |
… | …01000110011100000110 |
3 | 10120202201102121010202120 |
4 | 32232231011012130012 |
5 | 113041012101010042 |
6 | 2053001415150410 |
7 | 133062532321263 |
oct | 16565505063406 |
9 | 3522642533676 |
10 | 1012221110022 |
11 | 36030a478821 |
12 | 144212975406 |
13 | 745b51990a5 |
14 | 36dc558026a |
15 | 1b4e4610dec |
hex | ebad146706 |
1012221110022 has 8 divisors (see below), whose sum is σ = 2024442220056. Its totient is φ = 337407036672.
The previous prime is 1012221109993. The next prime is 1012221110053. The reversal of 1012221110022 is 2200111222101.
1012221110022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
1012221110022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 1012221109983 and 1012221110010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 84351759163 + ... + 84351759174.
It is an arithmetic number, because the mean of its divisors is an integer number (253055277507).
Almost surely, 21012221110022 is an apocalyptic number.
1012221110022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012221110022 is a wasteful number, since it uses less digits than its factorization.
1012221110022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 168703518342.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1012221110022 its reverse (2200111222101), we get a palindrome (3212332332123).
The spelling of 1012221110022 in words is "one trillion, twelve billion, two hundred twenty-one million, one hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •