Base | Representation |
---|---|
bin | 111110110011011… |
… | …011101000000011 |
3 | 2201102122222100210 |
4 | 332303123220003 |
5 | 4124214414031 |
6 | 252315445203 |
7 | 35053021611 |
oct | 7663335003 |
9 | 2642588323 |
10 | 1053669891 |
11 | 4a085086a |
12 | 254a56803 |
13 | 13a3abb11 |
14 | 9dd1c6b1 |
15 | 62783746 |
hex | 3ecdba03 |
1053669891 has 8 divisors (see below), whose sum is σ = 1424680704. Its totient is φ = 692552840.
The previous prime is 1053669889. The next prime is 1053669913. The reversal of 1053669891 is 1989663501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1053669891 - 21 = 1053669889 is a prime.
It is a super-2 number, since 2×10536698912 = 2220440478399903762, 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 1053669891.
It is not an unprimeable number, because it can be changed into a prime (1053669691) 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 7 ways as a sum of consecutive naturals, for example, 2473191 + ... + 2473616.
It is an arithmetic number, because the mean of its divisors is an integer number (178085088).
Almost surely, 21053669891 is an apocalyptic number.
1053669891 is a deficient number, since it is larger than the sum of its proper divisors (371010813).
1053669891 is an equidigital number, since it uses as much as digits as its factorization.
1053669891 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4946881.
The product of its (nonzero) digits is 349920, while the sum is 48.
The square root of 1053669891 is about 32460.2817455425. The cubic root of 1053669891 is about 1017.5791271544.
The spelling of 1053669891 in words is "one billion, fifty-three million, six hundred sixty-nine thousand, eight hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •