Base | Representation |
---|---|
bin | 11000011111001000… |
… | …00110100111011010 |
3 | 1020221011120020021222 |
4 | 30033210012213122 |
5 | 203410340240120 |
6 | 10012244532042 |
7 | 643525235531 |
oct | 141744064732 |
9 | 36834506258 |
10 | 13146024410 |
11 | 5636651792 |
12 | 266a6b1022 |
13 | 131670b18c |
14 | 8c9cdb318 |
15 | 51e198525 |
hex | 30f9069da |
13146024410 has 32 divisors (see below), whose sum is σ = 23761665792. Its totient is φ = 5236493760.
The previous prime is 13146024377. The next prime is 13146024413. The reversal of 13146024410 is 1442064131.
It is a happy number.
13146024410 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 13146024410.
It is not an unprimeable number, because it can be changed into a prime (13146024413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3010889 + ... + 3015251.
It is an arithmetic number, because the mean of its divisors is an integer number (742552056).
Almost surely, 213146024410 is an apocalyptic number.
13146024410 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13146024410 is a deficient number, since it is larger than the sum of its proper divisors (10615641382).
13146024410 is a wasteful number, since it uses less digits than its factorization.
13146024410 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5558.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 13146024410 its reverse (1442064131), we get a palindrome (14588088541).
The spelling of 13146024410 in words is "thirteen billion, one hundred forty-six million, twenty-four thousand, four hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •