Base | Representation |
---|---|
bin | 11000100001001010… |
… | …00011010000010000 |
3 | 1020222100121020000101 |
4 | 30100211003100100 |
5 | 203424220100000 |
6 | 10014053502144 |
7 | 644123036032 |
oct | 142045032020 |
9 | 36870536011 |
10 | 13163050000 |
11 | 5645220321 |
12 | 2674341954 |
13 | 131a0bc7a9 |
14 | 8cc28dc52 |
15 | 52090ce6a |
hex | 310943410 |
13163050000 has 120 divisors (see below), whose sum is σ = 32659800264. Its totient is φ = 5136000000.
The previous prime is 13163049947. The next prime is 13163050039. The reversal of 13163050000 is 5036131.
It can be written as a sum of positive squares in 12 ways, for example, as 11532182544 + 1630867456 = 107388^2 + 40384^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 13163050000.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2046790 + ... + 2053210.
Almost surely, 213163050000 is an apocalyptic number.
13163050000 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 13163050000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16329900132).
13163050000 is an abundant number, since it is smaller than the sum of its proper divisors (19496750264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13163050000 is an frugal number, since it uses more digits than its factorization.
13163050000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6495 (or 6469 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 19.
Adding to 13163050000 its reverse (5036131), we get a palindrome (13168086131).
The spelling of 13163050000 in words is "thirteen billion, one hundred sixty-three million, fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •