Base | Representation |
---|---|
bin | 11000101100111110… |
… | …01000000010000000 |
3 | 1021020021002112101010 |
4 | 30112133020002000 |
5 | 204130103110000 |
6 | 10031554040520 |
7 | 646435333335 |
oct | 142637100200 |
9 | 37207075333 |
10 | 13262160000 |
11 | 5696164111 |
12 | 26a1579140 |
13 | 13347b116b |
14 | 8db4cc98c |
15 | 529488d50 |
hex | 3167c8080 |
13262160000 has 160 divisors (see below), whose sum is σ = 44021221200. Its totient is φ = 3536512000.
The previous prime is 13262159993. The next prime is 13262160001. The reversal of 13262160000 is 6126231.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (160).
It is not an unprimeable number, because it can be changed into a prime (13262160001) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 212371 + ... + 267629.
Almost surely, 213262160000 is an apocalyptic number.
13262160000 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 13262160000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22010610600).
13262160000 is an abundant number, since it is smaller than the sum of its proper divisors (30759061200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13262160000 is an frugal number, since it uses more digits than its factorization.
13262160000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55296 (or 55269 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 13262160000 its reverse (6126231), we get a palindrome (13268286231).
The spelling of 13262160000 in words is "thirteen billion, two hundred sixty-two million, one hundred sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •