Base | Representation |
---|---|
bin | 1001100111001010… |
… | …10011010111111111 |
3 | 111022122011200001022 |
4 | 10303211103113333 |
5 | 41032024241444 |
6 | 2212020534355 |
7 | 241610353211 |
oct | 46345232777 |
9 | 14278150038 |
10 | 5160383999 |
11 | 22089a1971 |
12 | 10002513bb |
13 | 643155074 |
14 | 36d4d05b1 |
15 | 2030879ee |
hex | 1339535ff |
5160383999 has 4 divisors (see below), whose sum is σ = 5244980520. Its totient is φ = 5075787480.
The previous prime is 5160383989. The next prime is 5160384023. The reversal of 5160383999 is 9993830615.
5160383999 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5160383999 - 232 = 865416703 is a prime.
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 5160383999.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5160383939) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 42298169 + ... + 42298290.
It is an arithmetic number, because the mean of its divisors is an integer number (1311245130).
Almost surely, 25160383999 is an apocalyptic number.
5160383999 is a deficient number, since it is larger than the sum of its proper divisors (84596521).
5160383999 is an equidigital number, since it uses as much as digits as its factorization.
5160383999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84596520.
The product of its (nonzero) digits is 1574640, while the sum is 53.
The square root of 5160383999 is about 71835.8127886084. The cubic root of 5160383999 is about 1728.0673840919.
The spelling of 5160383999 in words is "five billion, one hundred sixty million, three hundred eighty-three thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •