Base | Representation |
---|---|
bin | 1010001010111001… |
… | …10000110010100101 |
3 | 112002112012121020002 |
4 | 11011130300302211 |
5 | 42140243310302 |
6 | 2301445351045 |
7 | 252210245105 |
oct | 50534606245 |
9 | 15075177202 |
10 | 5460135077 |
11 | 2352116331 |
12 | 1084708485 |
13 | 690296777 |
14 | 39b23b205 |
15 | 21e547c02 |
hex | 145730ca5 |
5460135077 has 2 divisors, whose sum is σ = 5460135078. Its totient is φ = 5460135076.
The previous prime is 5460135061. The next prime is 5460135113. The reversal of 5460135077 is 7705310645.
5460135077 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5073855361 + 386279716 = 71231^2 + 19654^2 .
It is a cyclic number.
It is not a de Polignac number, because 5460135077 - 24 = 5460135061 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5460135077.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5460135047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2730067538 + 2730067539.
It is an arithmetic number, because the mean of its divisors is an integer number (2730067539).
Almost surely, 25460135077 is an apocalyptic number.
It is an amenable number.
5460135077 is a deficient number, since it is larger than the sum of its proper divisors (1).
5460135077 is an equidigital number, since it uses as much as digits as its factorization.
5460135077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 88200, while the sum is 38.
The square root of 5460135077 is about 73892.7268207095. The cubic root of 5460135077 is about 1760.8990625407.
The spelling of 5460135077 in words is "five billion, four hundred sixty million, one hundred thirty-five thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •