Base | Representation |
---|---|
bin | 101001001001000… |
… | …0100001000000000 |
3 | 10120012120222222211 |
4 | 1102102010020000 |
5 | 10311344422300 |
6 | 344552111504 |
7 | 46131530500 |
oct | 12222041000 |
9 | 3505528884 |
10 | 1380467200 |
11 | 649268492 |
12 | 326395594 |
13 | 18ccccbc8 |
14 | d14a9a00 |
15 | 812d74ba |
hex | 52484200 |
1380467200 has 360 divisors, whose sum is σ = 4164804864. Its totient is φ = 451584000.
The previous prime is 1380467177. The next prime is 1380467213. The reversal of 1380467200 is 27640831.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 19443165 + ... + 19443235.
Almost surely, 21380467200 is an apocalyptic number.
1380467200 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 1380467200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2082402432).
1380467200 is an abundant number, since it is smaller than the sum of its proper divisors (2784337664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1380467200 is an equidigital number, since it uses as much as digits as its factorization.
1380467200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144 (or 116 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 31.
The square root of 1380467200 is about 37154.6390104924. The cubic root of 1380467200 is about 1113.4619076134.
The spelling of 1380467200 in words is "one billion, three hundred eighty million, four hundred sixty-seven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •