Base | Representation |
---|---|
bin | 1001111000000100… |
… | …11111010111011110 |
3 | 111200112010100202120 |
4 | 10330002133113132 |
5 | 41324334044042 |
6 | 2234045403410 |
7 | 245252256423 |
oct | 47402372736 |
9 | 14615110676 |
10 | 5302253022 |
11 | 2280a901a0 |
12 | 103b869566 |
13 | 666668031 |
14 | 38429dd4a |
15 | 21075cdec |
hex | 13c09f5de |
5302253022 has 32 divisors (see below), whose sum is σ = 11571133824. Its totient is φ = 1606384800.
The previous prime is 5302253003. The next prime is 5302253023. The reversal of 5302253022 is 2203522035.
It is a super-2 number, since 2×53022530222 = 56227774218616264968, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5302252983 and 5302253001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5302253023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 578697 + ... + 587787.
It is an arithmetic number, because the mean of its divisors is an integer number (361597932).
Almost surely, 25302253022 is an apocalyptic number.
5302253022 is an abundant number, since it is smaller than the sum of its proper divisors (6268880802).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5302253022 is a wasteful number, since it uses less digits than its factorization.
5302253022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17944.
The product of its (nonzero) digits is 3600, while the sum is 24.
The square root of 5302253022 is about 72816.5710673058. The cubic root of 5302253022 is about 1743.7604212375.
Adding to 5302253022 its reverse (2203522035), we get a palindrome (7505775057).
The spelling of 5302253022 in words is "five billion, three hundred two million, two hundred fifty-three thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •