Base | Representation |
---|---|
bin | 1001001101001011100101… |
… | …11111100001110010001010 |
3 | 2122200022120211201120020220 |
4 | 10212211302333201302022 |
5 | 10123134414142401442 |
6 | 111020003225130510 |
7 | 4156405630564005 |
oct | 446456277416212 |
9 | 78608524646226 |
10 | 20244110122122 |
11 | 64a552a445917 |
12 | 232b53b629a36 |
13 | b3b01c052993 |
14 | 4ddb6a72853c |
15 | 2518e0a6aeec |
hex | 126972fe1c8a |
20244110122122 has 16 divisors (see below), whose sum is σ = 41429806762080. Its totient is φ = 6591105621072.
The previous prime is 20244110122073. The next prime is 20244110122141. The reversal of 20244110122122 is 22122101144202.
It is a super-3 number, since 3×202441101221223 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20244110122092 and 20244110122101.
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, 39232771297 + ... + 39232771812.
It is an arithmetic number, because the mean of its divisors is an integer number (2589362922630).
Almost surely, 220244110122122 is an apocalyptic number.
20244110122122 is an abundant number, since it is smaller than the sum of its proper divisors (21185696639958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20244110122122 is a wasteful number, since it uses less digits than its factorization.
20244110122122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78465543157.
The product of its (nonzero) digits is 1024, while the sum is 24.
Adding to 20244110122122 its reverse (22122101144202), we get a palindrome (42366211266324).
The spelling of 20244110122122 in words is "twenty trillion, two hundred forty-four billion, one hundred ten million, one hundred twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •