Base | Representation |
---|---|
bin | 101100111111111010… |
… | …011011001000101111 |
3 | 11121201021210212102011 |
4 | 230333322123020233 |
5 | 1242423112422432 |
6 | 34110235142051 |
7 | 3330224022022 |
oct | 547772331057 |
9 | 147637725364 |
10 | 48316920367 |
11 | 19544707451 |
12 | 94452a4927 |
13 | 4730168c11 |
14 | 24a4db11b9 |
15 | 13cbc34847 |
hex | b3fe9b22f |
48316920367 has 2 divisors, whose sum is σ = 48316920368. Its totient is φ = 48316920366.
The previous prime is 48316920359. The next prime is 48316920383. The reversal of 48316920367 is 76302961384.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 48316920367 - 23 = 48316920359 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 48316920367.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (48316920667) 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 as a sum of consecutive naturals, namely, 24158460183 + 24158460184.
It is an arithmetic number, because the mean of its divisors is an integer number (24158460184).
Almost surely, 248316920367 is an apocalyptic number.
48316920367 is a deficient number, since it is larger than the sum of its proper divisors (1).
48316920367 is an equidigital number, since it uses as much as digits as its factorization.
48316920367 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1306368, while the sum is 49.
The spelling of 48316920367 in words is "forty-eight billion, three hundred sixteen million, nine hundred twenty thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •