Base | Representation |
---|---|
bin | 101001011001011… |
… | …0100001111100100 |
3 | 10120210202012100201 |
4 | 1102302310033210 |
5 | 10321044143100 |
6 | 345500120244 |
7 | 46264516624 |
oct | 12262641744 |
9 | 3523665321 |
10 | 1389052900 |
11 | 6530a2004 |
12 | 329236084 |
13 | 191a17ac1 |
14 | d26a2884 |
15 | 81e3136a |
hex | 52cb43e4 |
1389052900 has 27 divisors (see below), whose sum is σ = 3015053769. Its totient is φ = 555472080.
The previous prime is 1389052883. The next prime is 1389052909. The reversal of 1389052900 is 92509831.
The square root of 1389052900 is 37270.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 500059044 + 888993856 = 22362^2 + 29816^2 .
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1389052900.
It is not an unprimeable number, because it can be changed into a prime (1389052909) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 370837 + ... + 374563.
Almost surely, 21389052900 is an apocalyptic number.
1389052900 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1389052900 is the 37270-th square number.
It is an amenable number.
1389052900 is an abundant number, since it is smaller than the sum of its proper divisors (1626000869).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1389052900 is an frugal number, since it uses more digits than its factorization.
1389052900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7468 (or 3734 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 37.
The cubic root of 1389052900 is about 1115.7654995185.
The spelling of 1389052900 in words is "one billion, three hundred eighty-nine million, fifty-two thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •