Base | Representation |
---|---|
bin | 101010100000011… |
… | …1111111010010000 |
3 | 10200101212211020220 |
4 | 1111000333322100 |
5 | 10410114401021 |
6 | 353311033040 |
7 | 50226364215 |
oct | 12500777220 |
9 | 3611784226 |
10 | 1426325136 |
11 | 67213a205 |
12 | 33980b780 |
13 | 199667b92 |
14 | d7605b0c |
15 | 85344cc6 |
hex | 5503fe90 |
1426325136 has 160 divisors (see below), whose sum is σ = 4080215040. Its totient is φ = 427617792.
The previous prime is 1426325129. The next prime is 1426325141. The reversal of 1426325136 is 6315236241.
It is a junction number, because it is equal to n+sod(n) for n = 1426325097 and 1426325106.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1450501 + ... + 1451483.
It is an arithmetic number, because the mean of its divisors is an integer number (25501344).
Almost surely, 21426325136 is an apocalyptic number.
1426325136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1426325136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2040107520).
1426325136 is an abundant number, since it is smaller than the sum of its proper divisors (2653889904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1426325136 is a wasteful number, since it uses less digits than its factorization.
1426325136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1093 (or 1087 counting only the distinct ones).
The product of its digits is 25920, while the sum is 33.
The square root of 1426325136 is about 37766.7199528897. The cubic root of 1426325136 is about 1125.6572649154.
The spelling of 1426325136 in words is "one billion, four hundred twenty-six million, three hundred twenty-five thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •