Base | Representation |
---|---|
bin | 1001100110010100… |
… | …10010010110110111 |
3 | 111022010211212021221 |
4 | 10303022102112313 |
5 | 41023221130233 |
6 | 2211205051211 |
7 | 241463225626 |
oct | 46312222667 |
9 | 14263755257 |
10 | 5153301943 |
11 | 22049a5029 |
12 | bb99b6b07 |
13 | 6418456ba |
14 | 36c5a96bd |
15 | 20263942d |
hex | 1332925b7 |
5153301943 has 8 divisors (see below), whose sum is σ = 5336203680. Its totient is φ = 4970747040.
The previous prime is 5153301913. The next prime is 5153301949. The reversal of 5153301943 is 3491033515.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5153301943 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5153301899 and 5153301908.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5153301949) 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 7 ways as a sum of consecutive naturals, for example, 56280 + ... + 116077.
It is an arithmetic number, because the mean of its divisors is an integer number (667025460).
Almost surely, 25153301943 is an apocalyptic number.
5153301943 is a deficient number, since it is larger than the sum of its proper divisors (182901737).
5153301943 is a wasteful number, since it uses less digits than its factorization.
5153301943 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173417.
The product of its (nonzero) digits is 24300, while the sum is 34.
The square root of 5153301943 is about 71786.5025126590. The cubic root of 5153301943 is about 1727.2764950923.
The spelling of 5153301943 in words is "five billion, one hundred fifty-three million, three hundred one thousand, nine hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •