Base | Representation |
---|---|
bin | 10110001001010101001001… |
… | …11010011101001010000011 |
3 | 20101102120220102120100201111 |
4 | 23010222210322131022003 |
5 | 22340341232113124001 |
6 | 251324021015544151 |
7 | 13154252146654204 |
oct | 1304524472351203 |
9 | 211376812510644 |
10 | 48699105989251 |
11 | 145761a1825443 |
12 | 556626808b057 |
13 | 21233c934b2c3 |
14 | c050994215ab |
15 | 596b974e2851 |
hex | 2c4aa4e9d283 |
48699105989251 has 4 divisors (see below), whose sum is σ = 49524514565400. Its totient is φ = 47873697413104.
The previous prime is 48699105989227. The next prime is 48699105989257. The reversal of 48699105989251 is 15298950199684.
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 48699105989251 - 27 = 48699105989123 is a prime.
It is a Smith number, since the sum of its digits (76) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (48699105989257) 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, 412704287986 + ... + 412704288103.
It is an arithmetic number, because the mean of its divisors is an integer number (12381128641350).
Almost surely, 248699105989251 is an apocalyptic number.
48699105989251 is a deficient number, since it is larger than the sum of its proper divisors (825408576149).
48699105989251 is an equidigital number, since it uses as much as digits as its factorization.
48699105989251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 825408576148.
The product of its (nonzero) digits is 503884800, while the sum is 76.
The spelling of 48699105989251 in words is "forty-eight trillion, six hundred ninety-nine billion, one hundred five million, nine hundred eighty-nine thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •