Base | Representation |
---|---|
bin | 11001000101001100… |
… | …00111101001000000 |
3 | 1021202102101010111120 |
4 | 30202212013221000 |
5 | 210034110220000 |
6 | 10104052312240 |
7 | 654453221466 |
oct | 144246075100 |
9 | 37672333446 |
10 | 13465320000 |
11 | 578a905240 |
12 | 2739612680 |
13 | 1367903892 |
14 | 91a494836 |
15 | 53c2196a0 |
hex | 322987a40 |
13465320000 has 420 divisors, whose sum is σ = 49052335728. Its totient is φ = 3232000000.
The previous prime is 13465319983. The next prime is 13465320019. The reversal of 13465320000 is 2356431.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (24).
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 59 ways as a sum of consecutive naturals, for example, 133319950 + ... + 133320050.
Almost surely, 213465320000 is an apocalyptic number.
13465320000 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 13465320000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24526167864).
13465320000 is an abundant number, since it is smaller than the sum of its proper divisors (35587015728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13465320000 is an equidigital number, since it uses as much as digits as its factorization.
13465320000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248 (or 122 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 24.
Adding to 13465320000 its reverse (2356431), we get a palindrome (13467676431).
The spelling of 13465320000 in words is "thirteen billion, four hundred sixty-five million, three hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •