Base | Representation |
---|---|
bin | 111110110010001… |
… | …110010000111110 |
3 | 2201102001212200220 |
4 | 332302032100332 |
5 | 4124124244042 |
6 | 252305002210 |
7 | 35050232031 |
oct | 7662162076 |
9 | 2642055626 |
10 | 1053353022 |
11 | 4a0654797 |
12 | 254923366 |
13 | 13a2ca817 |
14 | 9dc79018 |
15 | 6271e8ec |
hex | 3ec8e43e |
1053353022 has 16 divisors (see below), whose sum is σ = 2179351440. Its totient is φ = 339010112.
The previous prime is 1053353009. The next prime is 1053353023. The reversal of 1053353022 is 2203533501.
It is a happy number.
It is a super-2 number, since 2×10533530222 = 2219105177913064968, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1053352983 and 1053353001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1053353023) 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, 3026703 + ... + 3027050.
It is an arithmetic number, because the mean of its divisors is an integer number (136209465).
Almost surely, 21053353022 is an apocalyptic number.
1053353022 is an abundant number, since it is smaller than the sum of its proper divisors (1125998418).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1053353022 is a wasteful number, since it uses less digits than its factorization.
1053353022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6053787.
The product of its (nonzero) digits is 2700, while the sum is 24.
The square root of 1053353022 is about 32455.4005059251. The cubic root of 1053353022 is about 1017.4771117728.
Adding to 1053353022 its reverse (2203533501), we get a palindrome (3256886523).
The spelling of 1053353022 in words is "one billion, fifty-three million, three hundred fifty-three thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •