Base | Representation |
---|---|
bin | 11000110000110001… |
… | …11011011100010000 |
3 | 1021022111011202002201 |
4 | 30120120323130100 |
5 | 204211241340000 |
6 | 10035054252544 |
7 | 650303620612 |
oct | 143030733420 |
9 | 37274152081 |
10 | 13294090000 |
11 | 5702192644 |
12 | 26b01b7154 |
13 | 133b2b0759 |
14 | 901840db2 |
15 | 52c19496a |
hex | 31863b710 |
13294090000 has 75 divisors (see below), whose sum is σ = 32214260793. Its totient is φ = 5313024000.
The previous prime is 13294089983. The next prime is 13294090001. The reversal of 13294090000 is 9049231.
It is a happy number.
The square root of 13294090000 is 115300.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 7 ways, for example, as 6302454544 + 6991635456 = 79388^2 + 83616^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13294090001) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 11529424 + ... + 11530576.
Almost surely, 213294090000 is an apocalyptic number.
13294090000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13294090000 is the 115300-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13294090000
13294090000 is an abundant number, since it is smaller than the sum of its proper divisors (18920170793).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13294090000 is an frugal number, since it uses more digits than its factorization.
13294090000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2334 (or 1160 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 28.
The spelling of 13294090000 in words is "thirteen billion, two hundred ninety-four million, ninety thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •