Base | Representation |
---|---|
bin | 1010100111101110… |
… | …11110101111111100 |
3 | 112201101100122002100 |
4 | 11103313132233330 |
5 | 43134204120332 |
6 | 2341450025100 |
7 | 261205241166 |
oct | 52367365774 |
9 | 15641318070 |
10 | 5702020092 |
11 | 24667070aa |
12 | 1131718190 |
13 | 6cb4275b2 |
14 | 3c1403936 |
15 | 2358c767c |
hex | 153ddebfc |
5702020092 has 72 divisors (see below), whose sum is σ = 14995914752. Its totient is φ = 1824832800.
The previous prime is 5702020069. The next prime is 5702020097. The reversal of 5702020092 is 2900202075.
It is a happy number.
5702020092 is a `hidden beast` number, since 570 + 2 + 0 + 2 + 0 + 0 + 92 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5702020097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 121617 + ... + 161847.
Almost surely, 25702020092 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5702020092, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7497957376).
5702020092 is an abundant number, since it is smaller than the sum of its proper divisors (9293894660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5702020092 is a wasteful number, since it uses less digits than its factorization.
5702020092 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40399 (or 40394 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 5702020092 is about 75511.7215536767. The cubic root of 5702020092 is about 1786.5269874993.
The spelling of 5702020092 in words is "five billion, seven hundred two million, twenty thousand, ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •