Base | Representation |
---|---|
bin | 10111010010100000110… |
… | …110010100001101000101 |
3 | 12122222222110200020010110 |
4 | 113102200312110031011 |
5 | 202210133131132310 |
6 | 3223120432343233 |
7 | 223425026114034 |
oct | 27224066241505 |
9 | 5588873606113 |
10 | 1600426427205 |
11 | 567811aa4571 |
12 | 21a20b6a4b19 |
13 | b7bc538b328 |
14 | 576651b071b |
15 | 2b96dc67d20 |
hex | 174a0d94345 |
1600426427205 has 8 divisors (see below), whose sum is σ = 2560682283552. Its totient is φ = 853560761168.
The previous prime is 1600426427183. The next prime is 1600426427209. The reversal of 1600426427205 is 5027246240061.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1600426427205 - 212 = 1600426423109 is a prime.
It is a super-2 number, since 2×16004264272052 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1600426427209) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 53347547559 + ... + 53347547588.
It is an arithmetic number, because the mean of its divisors is an integer number (320085285444).
Almost surely, 21600426427205 is an apocalyptic number.
1600426427205 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1600426427205 is a deficient number, since it is larger than the sum of its proper divisors (960255856347).
1600426427205 is a wasteful number, since it uses less digits than its factorization.
1600426427205 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106695095155.
The product of its (nonzero) digits is 161280, while the sum is 39.
The spelling of 1600426427205 in words is "one trillion, six hundred billion, four hundred twenty-six million, four hundred twenty-seven thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •