Base | Representation |
---|---|
bin | 10100100011001101110… |
… | …011111111000100000101 |
3 | 12000000010210122022021002 |
4 | 110203031303333010011 |
5 | 141114142232330041 |
6 | 3000431242503045 |
7 | 204012454616462 |
oct | 24431563770405 |
9 | 5000123568232 |
10 | 1412202230021 |
11 | 4a4a03385310 |
12 | 1a983b804a85 |
13 | a3229926a1b |
14 | 4c4cb02a669 |
15 | 26b0452a59b |
hex | 148cdcff105 |
1412202230021 has 32 divisors (see below), whose sum is σ = 1723128422400. Its totient is φ = 1140660852480.
The previous prime is 1412202229981. The next prime is 1412202230027. The reversal of 1412202230021 is 1200322022141.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1412202230021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1412202229975 and 1412202230002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1412202230027) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 303260 + ... + 1707738.
It is an arithmetic number, because the mean of its divisors is an integer number (53847763200).
Almost surely, 21412202230021 is an apocalyptic number.
1412202230021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1412202230021 is a deficient number, since it is larger than the sum of its proper divisors (310926192379).
1412202230021 is a wasteful number, since it uses less digits than its factorization.
1412202230021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1404809.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 1412202230021 its reverse (1200322022141), we get a palindrome (2612524252162).
The spelling of 1412202230021 in words is "one trillion, four hundred twelve billion, two hundred two million, two hundred thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •