Base | Representation |
---|---|
bin | 100000001100111… |
… | …100011100011111 |
3 | 1101122121021012001 |
4 | 200030330130133 |
5 | 2101301423343 |
6 | 125335423131 |
7 | 16250112232 |
oct | 4014743437 |
9 | 1348537161 |
10 | 540264223 |
11 | 257a68564 |
12 | 130b24aa7 |
13 | 87c11c95 |
14 | 51a77419 |
15 | 3266d44d |
hex | 2033c71f |
540264223 has 4 divisors (see below), whose sum is σ = 544518400. Its totient is φ = 536010048.
The previous prime is 540264217. The next prime is 540264253. The reversal of 540264223 is 322462045.
540264223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 322462045 = 5 ⋅64492409.
It is a cyclic number.
It is not a de Polignac number, because 540264223 - 25 = 540264191 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 540264191 and 540264200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (540264253) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2126898 + ... + 2127151.
It is an arithmetic number, because the mean of its divisors is an integer number (136129600).
Almost surely, 2540264223 is an apocalyptic number.
540264223 is a deficient number, since it is larger than the sum of its proper divisors (4254177).
540264223 is a wasteful number, since it uses less digits than its factorization.
540264223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4254176.
The product of its (nonzero) digits is 11520, while the sum is 28.
The square root of 540264223 is about 23243.5845557435. The cubic root of 540264223 is about 814.4580802785.
The spelling of 540264223 in words is "five hundred forty million, two hundred sixty-four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •