Base | Representation |
---|---|
bin | 1011010101100100111… |
… | …00011100101011100000 |
3 | 1101020110202211221021010 |
4 | 11222302130130223200 |
5 | 22340234424433332 |
6 | 454541432300520 |
7 | 40100120444244 |
oct | 5526234345340 |
9 | 1336422757233 |
10 | 389540858592 |
11 | 140226728686 |
12 | 635b4541740 |
13 | 2a96c7a3382 |
14 | 14bd5082424 |
15 | a1ed5939cc |
hex | 5ab271cae0 |
389540858592 has 48 divisors (see below), whose sum is σ = 1022609508480. Its totient is φ = 129838730112.
The previous prime is 389540858563. The next prime is 389540858599. The reversal of 389540858592 is 295858045983.
It is a tau number, because it is divible by the number of its divisors (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (389540858599) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1502659 + ... + 1742717.
It is an arithmetic number, because the mean of its divisors is an integer number (21304364760).
Almost surely, 2389540858592 is an apocalyptic number.
389540858592 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
389540858592 is an abundant number, since it is smaller than the sum of its proper divisors (633068649888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
389540858592 is a wasteful number, since it uses less digits than its factorization.
389540858592 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256975 (or 256967 counting only the distinct ones).
The product of its (nonzero) digits is 124416000, while the sum is 66.
The spelling of 389540858592 in words is "three hundred eighty-nine billion, five hundred forty million, eight hundred fifty-eight thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •