Base | Representation |
---|---|
bin | 11000111000111010… |
… | …00011000000000000 |
3 | 1021111020111002000000 |
4 | 30130131003000000 |
5 | 204331220402100 |
6 | 10045532000000 |
7 | 652062330612 |
oct | 143435030000 |
9 | 37436432000 |
10 | 13362278400 |
11 | 5737726599 |
12 | 270b000000 |
13 | 134c466813 |
14 | 90a910db2 |
15 | 533163900 |
hex | 31c743000 |
13362278400 has 546 divisors, whose sum is σ = 49956417540. Its totient is φ = 3543367680.
The previous prime is 13362278353. The next prime is 13362278401. The reversal of 13362278400 is 487226331.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (13362278401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 41 ways as a sum of consecutive naturals, for example, 74649511 + ... + 74649689.
Almost surely, 213362278400 is an apocalyptic number.
13362278400 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 13362278400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24978208770).
13362278400 is an abundant number, since it is smaller than the sum of its proper divisors (36594139140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13362278400 is an frugal number, since it uses more digits than its factorization.
13362278400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231 (or 189 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 36.
The spelling of 13362278400 in words is "thirteen billion, three hundred sixty-two million, two hundred seventy-eight thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •