Base | Representation |
---|---|
bin | 11000001101111111… |
… | …11101001101111001 |
3 | 1020120011011211222212 |
4 | 30012333331031321 |
5 | 203112044043001 |
6 | 5550113024505 |
7 | 640131663362 |
oct | 140677751571 |
9 | 36504154885 |
10 | 13002331001 |
11 | 5572527800 |
12 | 262a555135 |
13 | 12c2a099aa |
14 | 8b4bb4b69 |
15 | 5117627bb |
hex | 306ffd379 |
13002331001 has 6 divisors (see below), whose sum is σ = 14291818506. Its totient is φ = 11820300800.
The previous prime is 13002330977. The next prime is 13002331003. The reversal of 13002331001 is 10013320031.
It can be written as a sum of positive squares in only one way, i.e., 11582925376 + 1419405625 = 107624^2 + 37675^2 .
It is not a de Polignac number, because 13002331001 - 218 = 13002068857 is a prime.
It is a super-2 number, since 2×130023310012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13002331003) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 53728520 + ... + 53728761.
It is an arithmetic number, because the mean of its divisors is an integer number (2381969751).
Almost surely, 213002331001 is an apocalyptic number.
13002331001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13002331001 is a deficient number, since it is larger than the sum of its proper divisors (1289487505).
13002331001 is a wasteful number, since it uses less digits than its factorization.
13002331001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 107457303 (or 107457292 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 13002331001 its reverse (10013320031), we get a palindrome (23015651032).
The spelling of 13002331001 in words is "thirteen billion, two million, three hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •