Base | Representation |
---|---|
bin | 101001001001000… |
… | …1011111100000000 |
3 | 10120012122121220000 |
4 | 1102102023330000 |
5 | 10311401433300 |
6 | 344552520000 |
7 | 46132023003 |
oct | 12222137400 |
9 | 3505577800 |
10 | 1380499200 |
11 | 64928a533 |
12 | 3263b0000 |
13 | 190011642 |
14 | d14b753a |
15 | 812e1c00 |
hex | 5248bf00 |
1380499200 has 270 divisors, whose sum is σ = 5106251304. Its totient is φ = 367994880.
The previous prime is 1380499199. The next prime is 1380499217. The reversal of 1380499200 is 29940831.
It is a tau number, because it is divible by the number of its divisors (270).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 517069 + ... + 519731.
Almost surely, 21380499200 is an apocalyptic number.
1380499200 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 1380499200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2553125652).
1380499200 is an abundant number, since it is smaller than the sum of its proper divisors (3725752104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1380499200 is an equidigital number, since it uses as much as digits as its factorization.
1380499200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2701 (or 2673 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 36.
The square root of 1380499200 is about 37155.0696406291. The cubic root of 1380499200 is about 1113.4705111030.
The spelling of 1380499200 in words is "one billion, three hundred eighty million, four hundred ninety-nine thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •