Base | Representation |
---|---|
bin | 10100100011011001100… |
… | …110110100001001010101 |
3 | 12000000122120222100100202 |
4 | 110203121212310021111 |
5 | 141120043411312041 |
6 | 3000503031550245 |
7 | 204020406540554 |
oct | 24433146641125 |
9 | 5000576870322 |
10 | 1412400104021 |
11 | 4a4aa5045a45 |
12 | 1a9895b2b385 |
13 | a325b91842a |
14 | 4c509417d9b |
15 | 26b16ab4a9b |
hex | 148d99b4255 |
1412400104021 has 16 divisors (see below), whose sum is σ = 1485902880000. Its totient is φ = 1341139345728.
The previous prime is 1412400103879. The next prime is 1412400104047. The reversal of 1412400104021 is 1204010042141.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1412400104021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1412400103984 and 1412400104002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1412400104221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2044046 + ... + 2646303.
It is an arithmetic number, because the mean of its divisors is an integer number (92868930000).
Almost surely, 21412400104021 is an apocalyptic number.
It is an amenable number.
1412400104021 is a deficient number, since it is larger than the sum of its proper divisors (73502775979).
1412400104021 is a wasteful number, since it uses less digits than its factorization.
1412400104021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4690588.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 1412400104021 its reverse (1204010042141), we get a palindrome (2616410146162).
The spelling of 1412400104021 in words is "one trillion, four hundred twelve billion, four hundred million, one hundred four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •