Base | Representation |
---|---|
bin | 1011110100110101010101… |
… | …1110101011011001000000 |
3 | 1201001000012122120020120120 |
4 | 2331031111132223121000 |
5 | 3201012202312013100 |
6 | 43353101343540240 |
7 | 2511246055252536 |
oct | 275152536533100 |
9 | 51030178506516 |
10 | 13002300110400 |
11 | 4163276496787 |
12 | 155bb23bba680 |
13 | 73415b36b8a3 |
14 | 32d4596c2156 |
15 | 17834657b0a0 |
hex | bd3557ab640 |
13002300110400 has 168 divisors, whose sum is σ = 43566005466240. Its totient is φ = 3393508055040.
The previous prime is 13002300110399. The next prime is 13002300110489. The reversal of 13002300110400 is 401100320031.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 13002300110400.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 28591555 + ... + 29042754.
Almost surely, 213002300110400 is an apocalyptic number.
13002300110400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13002300110400 is an abundant number, since it is smaller than the sum of its proper divisors (30563705355840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13002300110400 is a wasteful number, since it uses less digits than its factorization.
13002300110400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57634381 (or 57634366 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 13002300110400 its reverse (401100320031), we get a palindrome (13403400430431).
The spelling of 13002300110400 in words is "thirteen trillion, two billion, three hundred million, one hundred ten thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •