Base | Representation |
---|---|
bin | 1011111101001111010001… |
… | …1110000100111111000000 |
3 | 1201112210221020011101211222 |
4 | 2333103310132010333000 |
5 | 3210343421032414300 |
6 | 43543302233454212 |
7 | 2524550342353322 |
oct | 277236436047700 |
9 | 51483836141758 |
10 | 13146701451200 |
11 | 4209537265359 |
12 | 1583b03871368 |
13 | 744961a42c45 |
14 | 336437697612 |
15 | 17be9889d785 |
hex | bf4f4784fc0 |
13146701451200 has 168 divisors, whose sum is σ = 33478412728080. Its totient is φ = 5075249356800.
The previous prime is 13146701451199. The next prime is 13146701451209. The reversal of 13146701451200 is 215410764131.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13146701451209) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 114689915 + ... + 114804485.
Almost surely, 213146701451200 is an apocalyptic number.
13146701451200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13146701451200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16739206364040).
13146701451200 is an abundant number, since it is smaller than the sum of its proper divisors (20331711276880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13146701451200 is a wasteful number, since it uses less digits than its factorization.
13146701451200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 117095 (or 117080 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 35.
The spelling of 13146701451200 in words is "thirteen trillion, one hundred forty-six billion, seven hundred one million, four hundred fifty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •