Base | Representation |
---|---|
bin | 101010100000000… |
… | …1100011001111010 |
3 | 10200101111002212100 |
4 | 1111000030121322 |
5 | 10410041123140 |
6 | 353302324230 |
7 | 50224525155 |
oct | 12500143172 |
9 | 3611432770 |
10 | 1426114170 |
11 | 672005758 |
12 | 339729676 |
13 | 1995c2b50 |
14 | d758cc9c |
15 | 85302530 |
hex | 5500c67a |
1426114170 has 48 divisors (see below), whose sum is σ = 3993122952. Its totient is φ = 351043200.
The previous prime is 1426114159. The next prime is 1426114171. The reversal of 1426114170 is 714116241.
1426114170 is a `hidden beast` number, since 1 + 4 + 2 + 611 + 41 + 7 + 0 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 825815169 + 600299001 = 28737^2 + 24501^2 .
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1426114171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 608281 + ... + 610620.
Almost surely, 21426114170 is an apocalyptic number.
1426114170 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1426114170 is an abundant number, since it is smaller than the sum of its proper divisors (2567008782).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1426114170 is a wasteful number, since it uses less digits than its factorization.
1426114170 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1218927 (or 1218924 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 27.
The square root of 1426114170 is about 37763.9268350102. The cubic root of 1426114170 is about 1125.6017639842.
The spelling of 1426114170 in words is "one billion, four hundred twenty-six million, one hundred fourteen thousand, one hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •