Base | Representation |
---|---|
bin | 1111101010001110010… |
… | …10100000100011100111 |
3 | 1220102211122221101210110 |
4 | 13311013022200203213 |
5 | 32303424100133002 |
6 | 1051103353024103 |
7 | 53605514520021 |
oct | 7650712404347 |
9 | 1812748841713 |
10 | 538064849127 |
11 | 198212641aa3 |
12 | 883449b5033 |
13 | 3b97c310140 |
14 | 1c0847b7011 |
15 | dee27b6e6c |
hex | 7d472a08e7 |
538064849127 has 16 divisors (see below), whose sum is σ = 797528711168. Its totient is φ = 320435641440.
The previous prime is 538064849123. The next prime is 538064849159. The reversal of 538064849127 is 721948460835.
It is a happy number.
538064849127 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 538064849127 - 22 = 538064849123 is a prime.
It is a super-2 number, since 2×5380648491272 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (538064849123) 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, 222523543 + ... + 222525960.
It is an arithmetic number, because the mean of its divisors is an integer number (49845544448).
It is a 1-persistent number, because it is pandigital, but 2⋅538064849127 = 1076129698254 is not.
Almost surely, 2538064849127 is an apocalyptic number.
538064849127 is a deficient number, since it is larger than the sum of its proper divisors (259463862041).
538064849127 is a wasteful number, since it uses less digits than its factorization.
538064849127 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 445049550.
The product of its (nonzero) digits is 11612160, while the sum is 57.
The spelling of 538064849127 in words is "five hundred thirty-eight billion, sixty-four million, eight hundred forty-nine thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •