Base | Representation |
---|---|
bin | 1001010111100010… |
… | …01110101110110101 |
3 | 110222111111112222102 |
4 | 10223301032232311 |
5 | 40244444333411 |
6 | 2151015111445 |
7 | 235426166516 |
oct | 45361165665 |
9 | 13874445872 |
10 | 5029292981 |
11 | 21509a5289 |
12 | b84372585 |
13 | 621c46b0b |
14 | 359d28a0d |
15 | 1e67e0d3b |
hex | 12bc4ebb5 |
5029292981 has 8 divisors (see below), whose sum is σ = 5050805760. Its totient is φ = 5007798832.
The previous prime is 5029292977. The next prime is 5029292993. The reversal of 5029292981 is 1892929205.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5029292981 - 22 = 5029292977 is a prime.
It is a super-2 number, since 2×50292929812 = 50587575777471732722, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5029262981) 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 7 ways as a sum of consecutive naturals, for example, 880571 + ... + 886263.
It is an arithmetic number, because the mean of its divisors is an integer number (631350720).
Almost surely, 25029292981 is an apocalyptic number.
It is an amenable number.
5029292981 is a deficient number, since it is larger than the sum of its proper divisors (21512779).
5029292981 is a wasteful number, since it uses less digits than its factorization.
5029292981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9315.
The product of its (nonzero) digits is 233280, while the sum is 47.
The square root of 5029292981 is about 70917.5082825109. The cubic root of 5029292981 is about 1713.3087993740.
The spelling of 5029292981 in words is "five billion, twenty-nine million, two hundred ninety-two thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •