Base | Representation |
---|---|
bin | 101001100110010… |
… | …0100000010000000 |
3 | 10121021110002201021 |
4 | 1103030210002000 |
5 | 10324311132430 |
6 | 350300515224 |
7 | 46406060200 |
oct | 12314440200 |
9 | 3537402637 |
10 | 1395802240 |
11 | 656991978 |
12 | 32b54bb14 |
13 | 19323bbb1 |
14 | d353c400 |
15 | 8281607a |
hex | 53324080 |
1395802240 has 192 divisors, whose sum is σ = 3968403840. Its totient is φ = 467884032.
The previous prime is 1395802217. The next prime is 1395802253. The reversal of 1395802240 is 422085931.
It is a junction number, because it is equal to n+sod(n) for n = 1395802196 and 1395802205.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1473447 + ... + 1474393.
It is an arithmetic number, because the mean of its divisors is an integer number (20668770).
Almost surely, 21395802240 is an apocalyptic number.
1395802240 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 1395802240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1984201920).
1395802240 is an abundant number, since it is smaller than the sum of its proper divisors (2572601600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1395802240 is an equidigital number, since it uses as much as digits as its factorization.
1395802240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1027 (or 1008 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 34.
The square root of 1395802240 is about 37360.4368282813. The cubic root of 1395802240 is about 1117.5697304122.
The spelling of 1395802240 in words is "one billion, three hundred ninety-five million, eight hundred two thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •