Base | Representation |
---|---|
bin | 111110110001101… |
… | …111010000101110 |
3 | 2201101211102111111 |
4 | 332301233100232 |
5 | 4124111213110 |
6 | 252302142234 |
7 | 35046162553 |
oct | 7661572056 |
9 | 2641742444 |
10 | 1053226030 |
11 | 4a057833a |
12 | 25488197a |
13 | 13a284a8c |
14 | 9dc44a2a |
15 | 626e6e8a |
hex | 3ec6f42e |
1053226030 has 8 divisors (see below), whose sum is σ = 1895806872. Its totient is φ = 421290408.
The previous prime is 1053226001. The next prime is 1053226033. The reversal of 1053226030 is 306223501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×10532260302 = 2218570140539121800, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1053225992 and 1053226010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1053226033) 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, 52661292 + ... + 52661311.
It is an arithmetic number, because the mean of its divisors is an integer number (236975859).
Almost surely, 21053226030 is an apocalyptic number.
1053226030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1053226030 is a deficient number, since it is larger than the sum of its proper divisors (842580842).
1053226030 is a wasteful number, since it uses less digits than its factorization.
1053226030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105322610.
The product of its (nonzero) digits is 1080, while the sum is 22.
The square root of 1053226030 is about 32453.4440391155. Note that the first 3 decimals coincide. The cubic root of 1053226030 is about 1017.4362211933.
Adding to 1053226030 its reverse (306223501), we get a palindrome (1359449531).
The spelling of 1053226030 in words is "one billion, fifty-three million, two hundred twenty-six thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •