Base | Representation |
---|---|
bin | 100111000010111… |
… | …0100111100010000 |
3 | 10101022021112111111 |
4 | 1032011310330100 |
5 | 10140344303131 |
6 | 334001023104 |
7 | 44316044341 |
oct | 11605647420 |
9 | 3338245444 |
10 | 1310150416 |
11 | 612600443 |
12 | 306924a94 |
13 | 17b580143 |
14 | c60040c8 |
15 | 7a047ab1 |
hex | 4e174f10 |
1310150416 has 15 divisors (see below), whose sum is σ = 2538696981. Its totient is φ = 655002816.
The previous prime is 1310150411. The next prime is 1310150423. The reversal of 1310150416 is 6140510131.
The square root of 1310150416 is 36196.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 1088736016 + 221414400 = 32996^2 + 14880^2 .
It is a super-2 number, since 2×13101504162 = 3432988225089946112, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1310150411) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 140260 + ... + 149308.
Almost surely, 21310150416 is an apocalyptic number.
1310150416 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
1310150416 is the 36196-th square number.
It is an amenable number.
1310150416 is a deficient number, since it is larger than the sum of its proper divisors (1228546565).
1310150416 is an frugal number, since it uses more digits than its factorization.
1310150416 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18106 (or 9051 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 22.
The cubic root of 1310150416 is about 1094.2260583378.
Adding to 1310150416 its reverse (6140510131), we get a palindrome (7450660547).
The spelling of 1310150416 in words is "one billion, three hundred ten million, one hundred fifty thousand, four hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •