Base | Representation |
---|---|
bin | 11000011100110001… |
… | …11010100000010000 |
3 | 1020212210110211200210 |
4 | 30032120322200100 |
5 | 203340314022000 |
6 | 10010302244120 |
7 | 643165554012 |
oct | 141630724020 |
9 | 36783424623 |
10 | 13126314000 |
11 | 5626509a98 |
12 | 2663b86640 |
13 | 13125c9807 |
14 | 8c744a1b2 |
15 | 51c5a3350 |
hex | 30e63a810 |
13126314000 has 160 divisors (see below), whose sum is σ = 43352225280. Its totient is φ = 3414912000.
The previous prime is 13126313999. The next prime is 13126314011. The reversal of 13126314000 is 41362131.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 219321 + ... + 272679.
It is an arithmetic number, because the mean of its divisors is an integer number (270951408).
Almost surely, 213126314000 is an apocalyptic number.
13126314000 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 13126314000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21676112640).
13126314000 is an abundant number, since it is smaller than the sum of its proper divisors (30225911280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13126314000 is a wasteful number, since it uses less digits than its factorization.
13126314000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53426 (or 53410 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 13126314000 its reverse (41362131), we get a palindrome (13167676131).
The spelling of 13126314000 in words is "thirteen billion, one hundred twenty-six million, three hundred fourteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •