Base | Representation |
---|---|
bin | 1001010111100011… |
… | …01010111000101001 |
3 | 110222111201102011101 |
4 | 10223301222320221 |
5 | 40300012031142 |
6 | 2151021401401 |
7 | 235430156644 |
oct | 45361527051 |
9 | 13874642141 |
10 | 5029408297 |
11 | 2150a73991 |
12 | b84409261 |
13 | 621c87454 |
14 | 359d58a5b |
15 | 1e68150b7 |
hex | 12bc6ae29 |
5029408297 has 4 divisors (see below), whose sum is σ = 5044603216. Its totient is φ = 5014213380.
The previous prime is 5029408283. The next prime is 5029408301. The reversal of 5029408297 is 7928049205.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 7928049205 = 5 ⋅1585609841.
It is a cyclic number.
It is not a de Polignac number, because 5029408297 - 27 = 5029408169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5029408277) 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 3 ways as a sum of consecutive naturals, for example, 7596963 + ... + 7597624.
It is an arithmetic number, because the mean of its divisors is an integer number (1261150804).
Almost surely, 25029408297 is an apocalyptic number.
It is an amenable number.
5029408297 is a deficient number, since it is larger than the sum of its proper divisors (15194919).
5029408297 is a wasteful number, since it uses less digits than its factorization.
5029408297 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15194918.
The product of its (nonzero) digits is 362880, while the sum is 46.
The square root of 5029408297 is about 70918.3213069796. The cubic root of 5029408297 is about 1713.3218940182.
The spelling of 5029408297 in words is "five billion, twenty-nine million, four hundred eight thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •