Base | Representation |
---|---|
bin | 10100101011000111110… |
… | …110100010001111101011 |
3 | 12000211001110221221001200 |
4 | 110223013312202033223 |
5 | 141234034143412312 |
6 | 3004353523415243 |
7 | 204433035123306 |
oct | 24530766421753 |
9 | 5024043857050 |
10 | 1420692169707 |
11 | 4a856a768698 |
12 | 1ab40ab24523 |
13 | a3c8080ba85 |
14 | 4ca947cbb3d |
15 | 26e4ea530dc |
hex | 14ac7da23eb |
1420692169707 has 12 divisors (see below), whose sum is σ = 2076835140744. Its totient is φ = 935716930560.
The previous prime is 1420692169697. The next prime is 1420692169717. The reversal of 1420692169707 is 7079612960241.
1420692169707 is a `hidden beast` number, since 1 + 420 + 6 + 92 + 1 + 69 + 70 + 7 = 666.
It is an interprime number because it is at equal distance from previous prime (1420692169697) and next prime (1420692169717).
It is not a de Polignac number, because 1420692169707 - 215 = 1420692136939 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1420692169717) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 950931094 + ... + 950932587.
It is an arithmetic number, because the mean of its divisors is an integer number (173069595062).
Almost surely, 21420692169707 is an apocalyptic number.
1420692169707 is a deficient number, since it is larger than the sum of its proper divisors (656142971037).
1420692169707 is a wasteful number, since it uses less digits than its factorization.
1420692169707 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1901863770 (or 1901863767 counting only the distinct ones).
The product of its (nonzero) digits is 2286144, while the sum is 54.
The spelling of 1420692169707 in words is "one trillion, four hundred twenty billion, six hundred ninety-two million, one hundred sixty-nine thousand, seven hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •