Base | Representation |
---|---|
bin | 11000100110110100… |
… | …00010110100001000 |
3 | 1021002122212202001102 |
4 | 30103122002310020 |
5 | 204023341340024 |
6 | 10022510440532 |
7 | 645240236240 |
oct | 142332026410 |
9 | 37078782042 |
10 | 13210496264 |
11 | 5669a87409 |
12 | 2688203148 |
13 | 1326b926c4 |
14 | 8d46c0b20 |
15 | 524b811ae |
hex | 313682d08 |
13210496264 has 32 divisors (see below), whose sum is σ = 28313915520. Its totient is φ = 5660499456.
The previous prime is 13210496261. The next prime is 13210496267. The reversal of 13210496264 is 46269401231.
It is an interprime number because it is at equal distance from previous prime (13210496261) and next prime (13210496267).
It is not an unprimeable number, because it can be changed into a prime (13210496261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 293912 + ... + 335864.
It is an arithmetic number, because the mean of its divisors is an integer number (884809860).
Almost surely, 213210496264 is an apocalyptic number.
13210496264 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
13210496264 is an abundant number, since it is smaller than the sum of its proper divisors (15103419256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13210496264 is a wasteful number, since it uses less digits than its factorization.
13210496264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47589 (or 47585 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 38.
Adding to 13210496264 its reverse (46269401231), we get a palindrome (59479897495).
The spelling of 13210496264 in words is "thirteen billion, two hundred ten million, four hundred ninety-six thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •