Base | Representation |
---|---|
bin | 10100101010110001010… |
… | …000010111000011011011 |
3 | 12000210002001121100022100 |
4 | 110222301100113003123 |
5 | 141232300121014033 |
6 | 3004252142054443 |
7 | 204420452562645 |
oct | 24526120270333 |
9 | 5023061540270 |
10 | 1420313063643 |
11 | 4a83957736a1 |
12 | 1ab323b7a423 |
13 | a3c20104766 |
14 | 4ca5a305895 |
15 | 26e2b61a513 |
hex | 14ab14170db |
1420313063643 has 6 divisors (see below), whose sum is σ = 2051563314164. Its totient is φ = 946875375756.
The previous prime is 1420313063593. The next prime is 1420313063657. The reversal of 1420313063643 is 3463603130241.
1420313063643 is a `hidden beast` number, since 1 + 4 + 2 + 0 + 3 + 1 + 3 + 0 + 6 + 3 + 643 = 666.
It is not a de Polignac number, because 1420313063643 - 213 = 1420313055451 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1420313063598 and 1420313063607.
It is not an unprimeable number, because it can be changed into a prime (1420313063243) 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 5 ways as a sum of consecutive naturals, for example, 78906281305 + ... + 78906281322.
Almost surely, 21420313063643 is an apocalyptic number.
1420313063643 is a deficient number, since it is larger than the sum of its proper divisors (631250250521).
1420313063643 is a wasteful number, since it uses less digits than its factorization.
1420313063643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157812562633 (or 157812562630 counting only the distinct ones).
The product of its (nonzero) digits is 93312, while the sum is 36.
Adding to 1420313063643 its reverse (3463603130241), we get a palindrome (4883916193884).
The spelling of 1420313063643 in words is "one trillion, four hundred twenty billion, three hundred thirteen million, sixty-three thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.051 sec. • engine limits •