Base | Representation |
---|---|
bin | 1001001001100111000011… |
… | …00101000110000010000110 |
3 | 2122020120212202110021120111 |
4 | 10210303201211012002012 |
5 | 10114132122310141402 |
6 | 110443352050023234 |
7 | 4144503222010240 |
oct | 444634145060206 |
9 | 78216782407514 |
10 | 20121411412102 |
11 | 64584961a5a40 |
12 | 230b7b7b77b1a |
13 | b2c596a140a0 |
14 | 4d7c4ac07090 |
15 | 24d60dbd79d7 |
hex | 124ce1946086 |
20121411412102 has 128 divisors (see below), whose sum is σ = 42913399753728. Its totient is φ = 6809942937600.
The previous prime is 20121411412087. The next prime is 20121411412121.
20121411412102 is nontrivially palindromic in base 10.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 309370578 + ... + 309435610.
It is an arithmetic number, because the mean of its divisors is an integer number (335260935576).
Almost surely, 220121411412102 is an apocalyptic number.
20121411412102 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20121411412102 is an abundant number, since it is smaller than the sum of its proper divisors (22791988341626).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20121411412102 is a wasteful number, since it uses less digits than its factorization.
20121411412102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74174.
The product of its (nonzero) digits is 256, while the sum is 22.
It can be divided in two parts, 2012141 and 1412102, that added together give a palindrome (3424243).
The spelling of 20121411412102 in words is "twenty trillion, one hundred twenty-one billion, four hundred eleven million, four hundred twelve thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •