Base | Representation |
---|---|
bin | 100111000010110… |
… | …1011100100001010 |
3 | 10101022012120211001 |
4 | 1032011223210022 |
5 | 10140342041020 |
6 | 334000125214 |
7 | 44315524354 |
oct | 11605534412 |
9 | 3338176731 |
10 | 1310112010 |
11 | 6125845a9 |
12 | 30690680a |
13 | 17b56880c |
14 | c5dd40d4 |
15 | 7a03b50a |
hex | 4e16b90a |
1310112010 has 8 divisors (see below), whose sum is σ = 2358201636. Its totient is φ = 524044800.
The previous prime is 1310112007. The next prime is 1310112017. The reversal of 1310112010 is 102110131.
It can be written as a sum of positive squares in 2 ways, for example, as 1296072001 + 14040009 = 36001^2 + 3747^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 131011201 = 1310112010 / (1 + 3 + 1 + 0 + 1 + 1 + 2 + 0 + 1 + 0).
It is not an unprimeable number, because it can be changed into a prime (1310112017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 65505591 + ... + 65505610.
Almost surely, 21310112010 is an apocalyptic number.
1310112010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1310112010 is a deficient number, since it is larger than the sum of its proper divisors (1048089626).
1310112010 is a wasteful number, since it uses less digits than its factorization.
1310112010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131011208.
The product of its (nonzero) digits is 6, while the sum is 10.
The square root of 1310112010 is about 36195.4694678768. The cubic root of 1310112010 is about 1094.2153661160.
Adding to 1310112010 its reverse (102110131), we get a palindrome (1412222141).
The spelling of 1310112010 in words is "one billion, three hundred ten million, one hundred twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •