Base | Representation |
---|---|
bin | 111110111001100… |
… | …000111011011001 |
3 | 2201112122222201101 |
4 | 332321200323121 |
5 | 4130121430343 |
6 | 252413551401 |
7 | 35102412544 |
oct | 7671407331 |
9 | 2645588641 |
10 | 1055264473 |
11 | 4a173a8aa |
12 | 2554a5561 |
13 | 13a819863 |
14 | a021585b |
15 | 6299ae4d |
hex | 3ee60ed9 |
1055264473 has 4 divisors (see below), whose sum is σ = 1055503120. Its totient is φ = 1055025828.
The previous prime is 1055264471. The next prime is 1055264513. The reversal of 1055264473 is 3744625501.
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 1055264473 - 21 = 1055264471 is a prime.
It is a super-2 number, since 2×10552644732 = 2227166215951935458, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1055264471) 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, 112563 + ... + 121576.
It is an arithmetic number, because the mean of its divisors is an integer number (263875780).
Almost surely, 21055264473 is an apocalyptic number.
It is an amenable number.
1055264473 is a deficient number, since it is larger than the sum of its proper divisors (238647).
1055264473 is an equidigital number, since it uses as much as digits as its factorization.
1055264473 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 238646.
The product of its (nonzero) digits is 100800, while the sum is 37.
The square root of 1055264473 is about 32484.8345078130. The cubic root of 1055264473 is about 1018.0921896509.
Adding to 1055264473 its reverse (3744625501), we get a palindrome (4799889974).
The spelling of 1055264473 in words is "one billion, fifty-five million, two hundred sixty-four thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •