Base | Representation |
---|---|
bin | 111110111010100… |
… | …100010001010101 |
3 | 2201120012000002112 |
4 | 332322210101111 |
5 | 4130204242214 |
6 | 252423520405 |
7 | 35104641665 |
oct | 7672442125 |
9 | 2646160075 |
10 | 1055540309 |
11 | 4a190906a |
12 | 2555b9105 |
13 | 13a8b5285 |
14 | a02881a5 |
15 | 62a02a3e |
hex | 3eea4455 |
1055540309 has 4 divisors (see below), whose sum is σ = 1055735616. Its totient is φ = 1055345004.
The previous prime is 1055540303. The next prime is 1055540351. The reversal of 1055540309 is 9030455501.
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, and also an emirpimes, since its reverse is a distinct semiprime: 9030455501 = 3571 ⋅2528831.
It is a cyclic number.
It is not a de Polignac number, because 1055540309 - 220 = 1054491733 is a prime.
It is a super-2 number, since 2×10555403092 = 2228330687847630962, which 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 (1055540303) 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, 89309 + ... + 100434.
It is an arithmetic number, because the mean of its divisors is an integer number (263933904).
Almost surely, 21055540309 is an apocalyptic number.
It is an amenable number.
1055540309 is a deficient number, since it is larger than the sum of its proper divisors (195307).
1055540309 is an equidigital number, since it uses as much as digits as its factorization.
1055540309 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 195306.
The product of its (nonzero) digits is 13500, while the sum is 32.
The square root of 1055540309 is about 32489.0798423101. The cubic root of 1055540309 is about 1018.1808884304.
The spelling of 1055540309 in words is "one billion, fifty-five million, five hundred forty thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •