Base | Representation |
---|---|
bin | 1011110110100100000001… |
… | …1000110001000100010000 |
3 | 1201010211220020212100012022 |
4 | 2331221000120301010100 |
5 | 3202004024304312240 |
6 | 43414453451351012 |
7 | 2513350244610161 |
oct | 275510030610420 |
9 | 51124806770168 |
10 | 13032011010320 |
11 | 4174932520625 |
12 | 1565836152468 |
13 | 736bb4881243 |
14 | 330a77593768 |
15 | 178ed4aea9b5 |
hex | bda40631110 |
13032011010320 has 80 divisors (see below), whose sum is σ = 32087724812208. Its totient is φ = 4905254338560.
The previous prime is 13032011010223. The next prime is 13032011010367. The reversal of 13032011010320 is 2301011023031.
It can be written as a sum of positive squares in 8 ways, for example, as 1199401709584 + 11832609300736 = 1095172^2 + 3439856^2 .
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (17).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6427772 + ... + 8208548.
Almost surely, 213032011010320 is an apocalyptic number.
13032011010320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13032011010320 is an abundant number, since it is smaller than the sum of its proper divisors (19055713801888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13032011010320 is a wasteful number, since it uses less digits than its factorization.
13032011010320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1786188 (or 1786182 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 13032011010320 its reverse (2301011023031), we get a palindrome (15333022033351).
The spelling of 13032011010320 in words is "thirteen trillion, thirty-two billion, eleven million, ten thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •