Base | Representation |
---|---|
bin | 100111001000100… |
… | …0111101101011000 |
3 | 10101111211221111000 |
4 | 1032101013231120 |
5 | 10142124021442 |
6 | 334144305000 |
7 | 44353154403 |
oct | 11621075530 |
9 | 3344757430 |
10 | 1313110872 |
11 | 6142426a7 |
12 | 307912160 |
13 | 17c0787a8 |
14 | c6574d3a |
15 | 7a42ed4c |
hex | 4e447b58 |
1313110872 has 128 divisors (see below), whose sum is σ = 3875083200. Its totient is φ = 410572800.
The previous prime is 1313110861. The next prime is 1313110873. The reversal of 1313110872 is 2780113131.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1313110873) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1986222 + ... + 1986882.
Almost surely, 21313110872 is an apocalyptic number.
1313110872 is a gapful number since it is divisible by the number (12) 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 1313110872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1937541600).
1313110872 is an abundant number, since it is smaller than the sum of its proper divisors (2561972328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1313110872 is a wasteful number, since it uses less digits than its factorization.
1313110872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1234 (or 1224 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 27.
The square root of 1313110872 is about 36236.8717192861. The cubic root of 1313110872 is about 1095.0496205699.
The spelling of 1313110872 in words is "one billion, three hundred thirteen million, one hundred ten thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •