Base | Representation |
---|---|
bin | 111110110001000… |
… | …101100100010011 |
3 | 2201101111202020100 |
4 | 332301011210103 |
5 | 4124040232001 |
6 | 252254343443 |
7 | 35044551633 |
oct | 7661054423 |
9 | 2641452210 |
10 | 1053055251 |
11 | 4a0470aa6 |
12 | 2547bab83 |
13 | 13a225121 |
14 | 9dbdc6c3 |
15 | 626b1586 |
hex | 3ec45913 |
1053055251 has 24 divisors (see below), whose sum is σ = 1585851696. Its totient is φ = 672759360.
The previous prime is 1053055247. The next prime is 1053055291. The reversal of 1053055251 is 1525503501.
1053055251 is a `hidden beast` number, since 10 + 53 + 0 + 552 + 51 = 666.
1053055251 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1053055251 - 22 = 1053055247 is a prime.
It is a super-2 number, since 2×10530552512 = 2217850723317346002, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1053055231) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5160 + ... + 46181.
It is an arithmetic number, because the mean of its divisors is an integer number (66077154).
Almost surely, 21053055251 is an apocalyptic number.
1053055251 is a deficient number, since it is larger than the sum of its proper divisors (532796445).
1053055251 is a wasteful number, since it uses less digits than its factorization.
1053055251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51443 (or 51440 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The square root of 1053055251 is about 32450.8127941351. The cubic root of 1053055251 is about 1017.3812263085.
Adding to 1053055251 its reverse (1525503501), we get a palindrome (2578558752).
The spelling of 1053055251 in words is "one billion, fifty-three million, fifty-five thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •