Base | Representation |
---|---|
bin | 111110110110010… |
… | …000011000111101 |
3 | 2201111001121000101 |
4 | 332312100120331 |
5 | 4124412112201 |
6 | 252343401101 |
7 | 35062224340 |
oct | 7666203075 |
9 | 2644047011 |
10 | 1054410301 |
11 | 4a120707a |
12 | 255153191 |
13 | 13a5aab29 |
14 | a0072457 |
15 | 6287cd01 |
hex | 3ed9063d |
1054410301 has 16 divisors (see below), whose sum is σ = 1280118400. Its totient is φ = 848346048.
The previous prime is 1054410283. The next prime is 1054410341. The reversal of 1054410301 is 1030144501.
It is not a de Polignac number, because 1054410301 - 221 = 1052313149 is a prime.
It is a super-2 number, since 2×10544103012 = 2223562165709821202, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1054410341) 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 15 ways as a sum of consecutive naturals, for example, 21870 + ... + 50863.
It is an arithmetic number, because the mean of its divisors is an integer number (80007400).
Almost surely, 21054410301 is an apocalyptic number.
It is an amenable number.
1054410301 is a deficient number, since it is larger than the sum of its proper divisors (225708099).
1054410301 is a wasteful number, since it uses less digits than its factorization.
1054410301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72868.
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 1054410301 is about 32471.6846036666. The cubic root of 1054410301 is about 1017.8174210642.
Adding to 1054410301 its reverse (1030144501), we get a palindrome (2084554802).
The spelling of 1054410301 in words is "one billion, fifty-four million, four hundred ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •