Base | Representation |
---|---|
bin | 1001101111011110101110… |
… | …10100010000010001110001 |
3 | 2210211222111211021120221020 |
4 | 10313233113110100101301 |
5 | 10301442003231104040 |
6 | 113321225124050053 |
7 | 4340506232133540 |
oct | 467572724202161 |
9 | 83758454246836 |
10 | 21422614316145 |
11 | 690a3093277a9 |
12 | 249ba1a233929 |
13 | bc51b40ab763 |
14 | 540c0803a157 |
15 | 2723b851dcd0 |
hex | 137bd7510471 |
21422614316145 has 64 divisors (see below), whose sum is σ = 39530178455040. Its totient is φ = 9703892717568.
The previous prime is 21422614316111. The next prime is 21422614316171. The reversal of 21422614316145 is 54161341622412.
It is not a de Polignac number, because 21422614316145 - 27 = 21422614316017 is a prime.
It is a super-2 number, since 2×214226143161452 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21422614316097 and 21422614316106.
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 63 ways as a sum of consecutive naturals, for example, 43763887 + ... + 44250683.
It is an arithmetic number, because the mean of its divisors is an integer number (617659038360).
Almost surely, 221422614316145 is an apocalyptic number.
It is an amenable number.
21422614316145 is a deficient number, since it is larger than the sum of its proper divisors (18107564138895).
21422614316145 is a wasteful number, since it uses less digits than its factorization.
21422614316145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 490634.
The product of its digits is 276480, while the sum is 42.
Adding to 21422614316145 its reverse (54161341622412), we get a palindrome (75583955938557).
The spelling of 21422614316145 in words is "twenty-one trillion, four hundred twenty-two billion, six hundred fourteen million, three hundred sixteen thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •