Base | Representation |
---|---|
bin | 1011010100110001101… |
… | …01001000000010000001 |
3 | 1101012100211012221202000 |
4 | 11222120311020002001 |
5 | 22333344421320001 |
6 | 454431041414213 |
7 | 40053351643122 |
oct | 5523065100201 |
9 | 1335324187660 |
10 | 389111120001 |
11 | 1400260a071a |
12 | 634b463a369 |
13 | 2a90174ba96 |
14 | 14b93d7a049 |
15 | a1c59a8a86 |
hex | 5a98d48081 |
389111120001 has 16 divisors (see below), whose sum is σ = 581749555200. Its totient is φ = 257027526864.
The previous prime is 389111119993. The next prime is 389111120039. The reversal of 389111120001 is 100021111983.
It is not a de Polignac number, because 389111120001 - 23 = 389111119993 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (389110120001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 66104961 + ... + 66110846.
It is an arithmetic number, because the mean of its divisors is an integer number (36359347200).
Almost surely, 2389111120001 is an apocalyptic number.
It is an amenable number.
389111120001 is a deficient number, since it is larger than the sum of its proper divisors (192638435199).
389111120001 is a wasteful number, since it uses less digits than its factorization.
389111120001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 132215925 (or 132215919 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 27.
Adding to 389111120001 its reverse (100021111983), we get a palindrome (489132231984).
The spelling of 389111120001 in words is "three hundred eighty-nine billion, one hundred eleven million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •