Base | Representation |
---|---|
bin | 10111001100011110000101… |
… | …100111101001100110001110 |
3 | 111101012020211101010011010211 |
4 | 113030132011213221212032 |
5 | 101332331044030323042 |
6 | 1000543400451553034 |
7 | 30326060464100566 |
oct | 2714360547514616 |
9 | 441166741104124 |
10 | 102012010011022 |
11 | 2a560061227001 |
12 | b53673b8bb77a |
13 | 44bc8ca9386c7 |
14 | 1b2959c767da6 |
15 | bbd876d49017 |
hex | 5cc7859e998e |
102012010011022 has 16 divisors (see below), whose sum is σ = 153832976623872. Its totient is φ = 50734763047480.
The previous prime is 102012010011019. The next prime is 102012010011031. The reversal of 102012010011022 is 220110010210201.
It is a super-2 number, since 2×1020120100110222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102012010010993 and 102012010011011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 102481798 + ... + 103472425.
It is an arithmetic number, because the mean of its divisors is an integer number (9614561038992).
Almost surely, 2102012010011022 is an apocalyptic number.
102012010011022 is a deficient number, since it is larger than the sum of its proper divisors (51820966612850).
102012010011022 is a wasteful number, since it uses less digits than its factorization.
102012010011022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205955543.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102012010011022 its reverse (220110010210201), we get a palindrome (322122020221223).
The spelling of 102012010011022 in words is "one hundred two trillion, twelve billion, ten million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.149 sec. • engine limits •