Base | Representation |
---|---|
bin | 1011110100110100101101… |
… | …1010110110000011010010 |
3 | 1201000222202212222110221222 |
4 | 2331031023122312003102 |
5 | 3201011331110131310 |
6 | 43353032514245042 |
7 | 2511241635546236 |
oct | 275151332660322 |
9 | 51028685873858 |
10 | 13002131333330 |
11 | 416319a199aa7 |
12 | 155ba97586782 |
13 | 7341323c70b9 |
14 | 32d44110a5c6 |
15 | 17833683d055 |
hex | bd34b6b60d2 |
13002131333330 has 32 divisors (see below), whose sum is σ = 23442485125248. Its totient is φ = 5192266780800.
The previous prime is 13002131333327. The next prime is 13002131333339. The reversal of 13002131333330 is 3333313120031.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 13002131333330.
It is not an unprimeable number, because it can be changed into a prime (13002131333339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 36918470 + ... + 37268990.
It is an arithmetic number, because the mean of its divisors is an integer number (732577660164).
Almost surely, 213002131333330 is an apocalyptic number.
13002131333330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13002131333330 is a deficient number, since it is larger than the sum of its proper divisors (10440353791918).
13002131333330 is a wasteful number, since it uses less digits than its factorization.
13002131333330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 356642.
The product of its (nonzero) digits is 4374, while the sum is 26.
Adding to 13002131333330 its reverse (3333313120031), we get a palindrome (16335444453361).
The spelling of 13002131333330 in words is "thirteen trillion, two billion, one hundred thirty-one million, three hundred thirty-three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •