Base | Representation |
---|---|
bin | 101111101110001… |
… | …0011100011011000 |
3 | 11010121001012210110 |
4 | 1133130103203120 |
5 | 11234410140030 |
6 | 422520244320 |
7 | 54452306535 |
oct | 13734234330 |
9 | 4117035713 |
10 | 1601255640 |
11 | 75195a076 |
12 | 3883106a0 |
13 | 1c698545a |
14 | 11293dd8c |
15 | 9589b1b0 |
hex | 5f7138d8 |
1601255640 has 32 divisors (see below), whose sum is σ = 4803767280. Its totient is φ = 427001472.
The previous prime is 1601255627. The next prime is 1601255641. The reversal of 1601255640 is 465521061.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 1601255598 and 1601255607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1601255641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6671779 + ... + 6672018.
Almost surely, 21601255640 is an apocalyptic number.
1601255640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1601255640 is an abundant number, since it is smaller than the sum of its proper divisors (3202511640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1601255640 is a wasteful number, since it uses less digits than its factorization.
1601255640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13343811 (or 13343807 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 30.
The square root of 1601255640 is about 40015.6924218487. The cubic root of 1601255640 is about 1169.9129747530.
The spelling of 1601255640 in words is "one billion, six hundred one million, two hundred fifty-five thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •