Base | Representation |
---|---|
bin | 11000110101011011… |
… | …10100100011100010 |
3 | 1021102012121201220120 |
4 | 30122231310203202 |
5 | 204301234340000 |
6 | 10043011021110 |
7 | 651256442421 |
oct | 143255644342 |
9 | 37365551816 |
10 | 13333121250 |
11 | 5722221379 |
12 | 270129a796 |
13 | 13463c8377 |
14 | 906ac12b8 |
15 | 5308046a0 |
hex | 31ab748e2 |
13333121250 has 80 divisors (see below), whose sum is σ = 35282431008. Its totient is φ = 3346336000.
The previous prime is 13333121189. The next prime is 13333121251. The reversal of 13333121250 is 5212133331.
13333121250 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 13333121250.
It is not an unprimeable number, because it can be changed into a prime (13333121251) 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 39 ways as a sum of consecutive naturals, for example, 40824 + ... + 168323.
Almost surely, 213333121250 is an apocalyptic number.
13333121250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13333121250 is an abundant number, since it is smaller than the sum of its proper divisors (21949309758).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13333121250 is a wasteful number, since it uses less digits than its factorization.
13333121250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209189 (or 209174 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 24.
Adding to 13333121250 its reverse (5212133331), we get a palindrome (18545254581).
The spelling of 13333121250 in words is "thirteen billion, three hundred thirty-three million, one hundred twenty-one thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •