Base | Representation |
---|---|
bin | 100111000010101… |
… | …0000101101011011 |
3 | 10101021222222221000 |
4 | 1032011100231123 |
5 | 10140330031021 |
6 | 333553520043 |
7 | 44314555563 |
oct | 11605205533 |
9 | 3337888830 |
10 | 1310002011 |
11 | 61250999a |
12 | 306873023 |
13 | 17b52a726 |
14 | c5da5da3 |
15 | 7a018b26 |
hex | 4e150b5b |
1310002011 has 8 divisors (see below), whose sum is σ = 1940743760. Its totient is φ = 873334656.
The previous prime is 1310001971. The next prime is 1310002019. The reversal of 1310002011 is 1102000131.
It is not a de Polignac number, because 1310002011 - 214 = 1309985627 is a prime.
It is a super-2 number, since 2×13100020112 = 3432210537648088242, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1310001984 and 1310002002.
It is not an unprimeable number, because it can be changed into a prime (1310002019) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24259270 + ... + 24259323.
It is an arithmetic number, because the mean of its divisors is an integer number (242592970).
Almost surely, 21310002011 is an apocalyptic number.
1310002011 is a deficient number, since it is larger than the sum of its proper divisors (630741749).
1310002011 is an equidigital number, since it uses as much as digits as its factorization.
1310002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48518602 (or 48518596 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 1310002011 is about 36193.9499226045. The cubic root of 1310002011 is about 1094.1847412626.
Adding to 1310002011 its reverse (1102000131), we get a palindrome (2412002142).
The spelling of 1310002011 in words is "one billion, three hundred ten million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •