Base | Representation |
---|---|
bin | 1100000001000111011000… |
… | …1000000100100110110000 |
3 | 1201210011211200101201010001 |
4 | 3000101312020010212300 |
5 | 3212441320103330000 |
6 | 44034035022115344 |
7 | 2532425631214534 |
oct | 300216610044660 |
9 | 51704750351101 |
10 | 13213301230000 |
11 | 423480308a963 |
12 | 15949aba1bb54 |
13 | 74b0168b7b91 |
14 | 339754885bc4 |
15 | 17da9571146a |
hex | c04762049b0 |
13213301230000 has 50 divisors (see below), whose sum is σ = 31990723632164. Its totient is φ = 5285320488000.
The previous prime is 13213301229977. The next prime is 13213301230001. The reversal of 13213301230000 is 3210331231.
It is a tau number, because it is divible by the number of its divisors (50).
It is a self number, because there is not a number n which added to its sum of digits gives 13213301230000.
It is not an unprimeable number, because it can be changed into a prime (13213301230001) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 660655062 + ... + 660675061.
Almost surely, 213213301230000 is an apocalyptic number.
13213301230000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13213301230000 is an abundant number, since it is smaller than the sum of its proper divisors (18777422402164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13213301230000 is an equidigital number, since it uses as much as digits as its factorization.
13213301230000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1321330151 (or 1321330130 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 13213301230000 its reverse (3210331231), we get a palindrome (13216511561231).
The spelling of 13213301230000 in words is "thirteen trillion, two hundred thirteen billion, three hundred one million, two hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •