Base | Representation |
---|---|
bin | 1010100100111101101001… |
… | …0010000100000001110011 |
3 | 1112011211102100200012101012 |
4 | 2221033122102010001303 |
5 | 3011022010442412301 |
6 | 40422451213301135 |
7 | 2310151451220044 |
oct | 251173222040163 |
9 | 45154370605335 |
10 | 11630138638451 |
11 | 3784350078673 |
12 | 1379bb9a947ab |
13 | 664943098028 |
14 | 2c2c8a4328cb |
15 | 1527d73d8ebb |
hex | a93da484073 |
11630138638451 has 8 divisors (see below), whose sum is σ = 11914415895984. Its totient is φ = 11345890682880.
The previous prime is 11630138638427. The next prime is 11630138638501. The reversal of 11630138638451 is 15483683103611.
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 11630138638451 - 210 = 11630138637427 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 11630138638451.
It is not an unprimeable number, because it can be changed into a prime (11630108638451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6520910 + ... + 8110643.
It is an arithmetic number, because the mean of its divisors is an integer number (1489301986998).
Almost surely, 211630138638451 is an apocalyptic number.
11630138638451 is a deficient number, since it is larger than the sum of its proper divisors (284277257533).
11630138638451 is a wasteful number, since it uses less digits than its factorization.
11630138638451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14650981.
The product of its (nonzero) digits is 1244160, while the sum is 50.
The spelling of 11630138638451 in words is "eleven trillion, six hundred thirty billion, one hundred thirty-eight million, six hundred thirty-eight thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •