Base | Representation |
---|---|
bin | 100000001110011… |
… | …110111101101011 |
3 | 1101200100202201200 |
4 | 200032132331223 |
5 | 2101402332010 |
6 | 125352215243 |
7 | 16253412555 |
oct | 4016367553 |
9 | 1350322650 |
10 | 540667755 |
11 | 258213761 |
12 | 13109a523 |
13 | 88023864 |
14 | 51b404d5 |
15 | 326eccc0 |
hex | 2039ef6b |
540667755 has 12 divisors (see below), whose sum is σ = 937157520. Its totient is φ = 288356112.
The previous prime is 540667733. The next prime is 540667759. The reversal of 540667755 is 557766045.
It is not a de Polignac number, because 540667755 - 29 = 540667243 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45), and also a Moran number because the ratio is a prime number: 12014839 = 540667755 / (5 + 4 + 0 + 6 + 6 + 7 + 7 + 5 + 5).
It is a self number, because there is not a number n which added to its sum of digits gives 540667755.
It is not an unprimeable number, because it can be changed into a prime (540667759) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6007375 + ... + 6007464.
It is an arithmetic number, because the mean of its divisors is an integer number (78096460).
Almost surely, 2540667755 is an apocalyptic number.
540667755 is a deficient number, since it is larger than the sum of its proper divisors (396489765).
540667755 is a wasteful number, since it uses less digits than its factorization.
540667755 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12014850 (or 12014847 counting only the distinct ones).
The product of its (nonzero) digits is 882000, while the sum is 45.
The square root of 540667755 is about 23252.2634382118. The cubic root of 540667755 is about 814.6608070745.
The spelling of 540667755 in words is "five hundred forty million, six hundred sixty-seven thousand, seven hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •