Base | Representation |
---|---|
bin | 101101111010010… |
… | …1110000111110001 |
3 | 10222100210220021102 |
4 | 1123310232013301 |
5 | 11123340001212 |
6 | 412511134145 |
7 | 53114301560 |
oct | 13364560761 |
9 | 3870726242 |
10 | 1540547057 |
11 | 720664895 |
12 | 36bb14355 |
13 | 1b721ab0a |
14 | 108859bd7 |
15 | 903a85c2 |
hex | 5bd2e1f1 |
1540547057 has 4 divisors (see below), whose sum is σ = 1760625216. Its totient is φ = 1320468900.
The previous prime is 1540547051. The next prime is 1540547083. The reversal of 1540547057 is 7507450451.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1540547057 - 26 = 1540546993 is a prime.
It is a super-2 number, since 2×15405470572 = 4746570469662722498, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1540547057.
It is not an unprimeable number, because it can be changed into a prime (1540547051) 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, 110039069 + ... + 110039082.
It is an arithmetic number, because the mean of its divisors is an integer number (440156304).
Almost surely, 21540547057 is an apocalyptic number.
It is an amenable number.
1540547057 is a deficient number, since it is larger than the sum of its proper divisors (220078159).
1540547057 is an equidigital number, since it uses as much as digits as its factorization.
1540547057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 220078158.
The product of its (nonzero) digits is 98000, while the sum is 38.
The square root of 1540547057 is about 39249.8032733923. The cubic root of 1540547057 is about 1154.9370747126.
The spelling of 1540547057 in words is "one billion, five hundred forty million, five hundred forty-seven thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •