Base | Representation |
---|---|
bin | 101001001001001… |
… | …0100101011011010 |
3 | 10120012201110000000 |
4 | 1102102110223122 |
5 | 10311404110002 |
6 | 344553353430 |
7 | 46132232250 |
oct | 12222245332 |
9 | 3505643000 |
10 | 1380535002 |
11 | 649304420 |
12 | 326408876 |
13 | 190024a22 |
14 | d14c65d0 |
15 | 812ec61c |
hex | 52494ada |
1380535002 has 128 divisors (see below), whose sum is σ = 3873024000. Its totient is φ = 358493040.
The previous prime is 1380534979. The next prime is 1380535007. The reversal of 1380535002 is 2005350831.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (1380535007) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 334749 + ... + 338847.
It is an arithmetic number, because the mean of its divisors is an integer number (30258000).
Almost surely, 21380535002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1380535002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1936512000).
1380535002 is an abundant number, since it is smaller than the sum of its proper divisors (2492488998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1380535002 is an equidigital number, since it uses as much as digits as its factorization.
1380535002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4140 (or 4122 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The square root of 1380535002 is about 37155.5514290933. The cubic root of 1380535002 is about 1113.4801366372.
Adding to 1380535002 its reverse (2005350831), we get a palindrome (3385885833).
The spelling of 1380535002 in words is "one billion, three hundred eighty million, five hundred thirty-five thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •