Base | Representation |
---|---|
bin | 10100101011111100000… |
… | …100010011100100100101 |
3 | 12000220022112100121122110 |
4 | 110223330010103210211 |
5 | 141242332424213403 |
6 | 3005020455551233 |
7 | 204463533166422 |
oct | 24537404234445 |
9 | 5026275317573 |
10 | 1421568194853 |
11 | 4a897a205314 |
12 | 1ab61438b519 |
13 | a409015ca51 |
14 | 4cb38ca6d49 |
15 | 26ea18e6103 |
hex | 14afc113925 |
1421568194853 has 16 divisors (see below), whose sum is σ = 1907027472896. Its totient is φ = 941922883440.
The previous prime is 1421568194843. The next prime is 1421568194899. The reversal of 1421568194853 is 3584918651241.
It is not a de Polignac number, because 1421568194853 - 29 = 1421568194341 is a prime.
It is a super-2 number, since 2×14215681948532 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1421568194793 and 1421568194802.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1421568194803) 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, 1084351 + ... + 2004732.
It is an arithmetic number, because the mean of its divisors is an integer number (119189217056).
Almost surely, 21421568194853 is an apocalyptic number.
It is an amenable number.
1421568194853 is a deficient number, since it is larger than the sum of its proper divisors (485459278043).
1421568194853 is a wasteful number, since it uses less digits than its factorization.
1421568194853 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3090024.
The product of its digits is 8294400, while the sum is 57.
The spelling of 1421568194853 in words is "one trillion, four hundred twenty-one billion, five hundred sixty-eight million, one hundred ninety-four thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •