Base | Representation |
---|---|
bin | 100111100000111… |
… | …0010101111011000 |
3 | 10102101212011202210 |
4 | 1033001302233120 |
5 | 10203410320130 |
6 | 335321555120 |
7 | 44566465215 |
oct | 11701625730 |
9 | 3371764683 |
10 | 1325870040 |
11 | 620467870 |
12 | 310045aa0 |
13 | 1818c51b1 |
14 | c8136b0c |
15 | 7b6005b0 |
hex | 4f072bd8 |
1325870040 has 128 divisors (see below), whose sum is σ = 4348753920. Its totient is φ = 320716800.
The previous prime is 1325870033. The next prime is 1325870059. The reversal of 1325870040 is 400785231.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
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, 845337 + ... + 846903.
It is an arithmetic number, because the mean of its divisors is an integer number (33974640).
Almost surely, 21325870040 is an apocalyptic number.
1325870040 is a gapful number since it is divisible by the number (10) 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 1325870040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2174376960).
1325870040 is an abundant number, since it is smaller than the sum of its proper divisors (3022883880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1325870040 is a wasteful number, since it uses less digits than its factorization.
1325870040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2233 (or 2229 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 30.
The square root of 1325870040 is about 36412.4984037075. The cubic root of 1325870040 is about 1098.5849683734.
The spelling of 1325870040 in words is "one billion, three hundred twenty-five million, eight hundred seventy thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •