Base | Representation |
---|---|
bin | 101001101011011… |
… | …0010110010011000 |
3 | 10121110111100120011 |
4 | 1103112302302120 |
5 | 10331002442440 |
6 | 350434211304 |
7 | 46440630115 |
oct | 12326626230 |
9 | 3543440504 |
10 | 1398484120 |
11 | 658453900 |
12 | 330423b34 |
13 | 19396a7c7 |
14 | d3a3990c |
15 | 82b959ea |
hex | 535b2c98 |
1398484120 has 96 divisors (see below), whose sum is σ = 3474268560. Its totient is φ = 506246400.
The previous prime is 1398484097. The next prime is 1398484123. The reversal of 1398484120 is 214848931.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1398484123) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1369210 + ... + 1370230.
Almost surely, 21398484120 is an apocalyptic number.
1398484120 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 1398484120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1737134280).
1398484120 is an abundant number, since it is smaller than the sum of its proper divisors (2075784440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1398484120 is a wasteful number, since it uses less digits than its factorization.
1398484120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1337 (or 1322 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 40.
The square root of 1398484120 is about 37396.3115828286. The cubic root of 1398484120 is about 1118.2850347919.
The spelling of 1398484120 in words is "one billion, three hundred ninety-eight million, four hundred eighty-four thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •