Base | Representation |
---|---|
bin | 11000110110010000… |
… | …01100000011100010 |
3 | 1021102200121220101120 |
4 | 30123020030003202 |
5 | 204310022031000 |
6 | 10043415113110 |
7 | 651402261135 |
oct | 143310140342 |
9 | 37380556346 |
10 | 13340033250 |
11 | 5726112475 |
12 | 2703672796 |
13 | 13479784cb |
14 | 9079a021c |
15 | 53121c6a0 |
hex | 31b20c0e2 |
13340033250 has 32 divisors (see below), whose sum is σ = 33296724864. Its totient is φ = 3557342000.
The previous prime is 13340033219. The next prime is 13340033279. The reversal of 13340033250 is 5233004331.
It is a happy number.
It is a super-2 number, since 2×133400332502 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13340033250.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 8892606 + ... + 8894105.
It is an arithmetic number, because the mean of its divisors is an integer number (1040522652).
Almost surely, 213340033250 is an apocalyptic number.
13340033250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13340033250 is an abundant number, since it is smaller than the sum of its proper divisors (19956691614).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13340033250 is a wasteful number, since it uses less digits than its factorization.
13340033250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17786731 (or 17786721 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 24.
Adding to 13340033250 its reverse (5233004331), we get a palindrome (18573037581).
The spelling of 13340033250 in words is "thirteen billion, three hundred forty million, thirty-three thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •