Base | Representation |
---|---|
bin | 1101111010100011010… |
… | …0010001111011011001 |
3 | 211212001012001120001201 |
4 | 3132220310101323121 |
5 | 12404041200302424 |
6 | 301453124314201 |
7 | 23162006016532 |
oct | 3365064217331 |
9 | 755035046051 |
10 | 239055478489 |
11 | 92423649253 |
12 | 3a3b7242961 |
13 | 197097ba469 |
14 | b7db063689 |
15 | 6342087d44 |
hex | 37a8d11ed9 |
239055478489 has 9 divisors (see below), whose sum is σ = 243205288437. Its totient is φ = 234975332604.
The previous prime is 239055478481. The next prime is 239055478499. The reversal of 239055478489 is 984874550932.
The square root of 239055478489 is 488933.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 239055478489 - 23 = 239055478481 is a prime.
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 239055478489.
It is not an unprimeable number, because it can be changed into a prime (239055478481) 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, 28842904 + ... + 28851190.
Almost surely, 2239055478489 is an apocalyptic number.
239055478489 is the 488933-rd square number.
239055478489 is the 244467-th centered octagonal number.
It is an amenable number.
239055478489 is a deficient number, since it is larger than the sum of its proper divisors (4149809948).
239055478489 is an frugal number, since it uses more digits than its factorization.
239055478489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16692 (or 8346 counting only the distinct ones).
The product of its (nonzero) digits is 87091200, while the sum is 64.
Multiplying 239055478489 by its sum of digits (64), we get a square (15299550623296 = 39114642).
The spelling of 239055478489 in words is "two hundred thirty-nine billion, fifty-five million, four hundred seventy-eight thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •