Base | Representation |
---|---|
bin | 11011011111001011… |
… | …011101001010111101 |
3 | 2211011220000221120021 |
4 | 123133023131022331 |
5 | 440421104013023 |
6 | 21320354052141 |
7 | 2063246634421 |
oct | 333713351275 |
9 | 84156027507 |
10 | 29514126013 |
11 | 11575a55789 |
12 | 587827a051 |
13 | 2a248178b8 |
14 | 15ddaccb81 |
15 | b7b15135d |
hex | 6df2dd2bd |
29514126013 has 8 divisors (see below), whose sum is σ = 29660918400. Its totient is φ = 29367528288.
The previous prime is 29514126001. The next prime is 29514126041. The reversal of 29514126013 is 31062141592.
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 29514126013 - 213 = 29514117821 is a prime.
It is a super-2 number, since 2×295141260132 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 29514126013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (29514126713) 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 7 ways as a sum of consecutive naturals, for example, 260170 + ... + 355972.
It is an arithmetic number, because the mean of its divisors is an integer number (3707614800).
Almost surely, 229514126013 is an apocalyptic number.
It is an amenable number.
29514126013 is a deficient number, since it is larger than the sum of its proper divisors (146792387).
29514126013 is a wasteful number, since it uses less digits than its factorization.
29514126013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97331.
The product of its (nonzero) digits is 12960, while the sum is 34.
The spelling of 29514126013 in words is "twenty-nine billion, five hundred fourteen million, one hundred twenty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •