Base | Representation |
---|---|
bin | 10111001100010… |
… | …100001010010000 |
3 | 1000010011112201100 |
4 | 113030110022100 |
5 | 1244102314042 |
6 | 102335504400 |
7 | 12433221534 |
oct | 2714241220 |
9 | 1003145640 |
10 | 389104272 |
11 | 18a703887 |
12 | aa388100 |
13 | 627c811b |
14 | 39969bc4 |
15 | 2426024c |
hex | 17314290 |
389104272 has 30 divisors (see below), whose sum is σ = 1088951942. Its totient is φ = 129701376.
The previous prime is 389104253. The next prime is 389104273. The reversal of 389104272 is 272401983.
389104272 is a `hidden beast` number, since 389 + 1 + 0 + 4 + 272 = 666.
It can be written as a sum of positive squares in only one way, i.e., 345067776 + 44036496 = 18576^2 + 6636^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (389104273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1350913 + ... + 1351200.
Almost surely, 2389104272 is an apocalyptic number.
It is an amenable number.
389104272 is an abundant number, since it is smaller than the sum of its proper divisors (699847670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
389104272 is a wasteful number, since it uses less digits than its factorization.
389104272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2702127 (or 2702118 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The square root of 389104272 is about 19725.7261463298. The cubic root of 389104272 is about 730.0545852722.
It can be divided in two parts, 389104 and 272, that added together give a square (389376 = 6242).
The spelling of 389104272 in words is "three hundred eighty-nine million, one hundred four thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •