Base | Representation |
---|---|
bin | 1011110111100111100101… |
… | …0010110010101001000000 |
3 | 1201012120201002022200022021 |
4 | 2331321321102302221000 |
5 | 3202303144234130100 |
6 | 43431053143051224 |
7 | 2514561526320046 |
oct | 275717122625100 |
9 | 51176632280267 |
10 | 13050145614400 |
11 | 4181598a8a024 |
12 | 1569257440b14 |
13 | 73881494cabb |
14 | 3318b7c1c396 |
15 | 1796e6be1a1a |
hex | bde794b2a40 |
13050145614400 has 84 divisors (see below), whose sum is σ = 32472318441060. Its totient is φ = 5161405849600.
The previous prime is 13050145614391. The next prime is 13050145614427. The reversal of 13050145614400 is 441654105031.
13050145614400 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 3187681726464 + 9862463887936 = 1785408^2 + 3140456^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 45679741 + ... + 45964540.
Almost surely, 213050145614400 is an apocalyptic number.
13050145614400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13050145614400 is an abundant number, since it is smaller than the sum of its proper divisors (19422172826660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13050145614400 is an equidigital number, since it uses as much as digits as its factorization.
13050145614400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91644392 (or 91644377 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 34.
Adding to 13050145614400 its reverse (441654105031), we get a palindrome (13491799719431).
The spelling of 13050145614400 in words is "thirteen trillion, fifty billion, one hundred forty-five million, six hundred fourteen thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •