Base | Representation |
---|---|
bin | 1010011010011111000100… |
… | …0000001110100000101110 |
3 | 1111112121210022221111102011 |
4 | 2212213301000032200232 |
5 | 3000044332042243314 |
6 | 40204041225351434 |
7 | 2261146632310333 |
oct | 246476100164056 |
9 | 44477708844364 |
10 | 11450131212334 |
11 | 3714a78624101 |
12 | 134b14193857a |
13 | 650986a53639 |
14 | 2b829166298a |
15 | 14cc9e2154c4 |
hex | a69f100e82e |
11450131212334 has 8 divisors (see below), whose sum is σ = 17175216820248. Its totient is φ = 5725058938920.
The previous prime is 11450131212319. The next prime is 11450131212347. The reversal of 11450131212334 is 43321213105411.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×114501312123342 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11450131212296 and 11450131212305.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 802572 + ... + 4852255.
It is an arithmetic number, because the mean of its divisors is an integer number (2146902102531).
Almost surely, 211450131212334 is an apocalyptic number.
11450131212334 is a deficient number, since it is larger than the sum of its proper divisors (5725085607914).
11450131212334 is a wasteful number, since it uses less digits than its factorization.
11450131212334 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6667250.
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 11450131212334 its reverse (43321213105411), we get a palindrome (54771344317745).
The spelling of 11450131212334 in words is "eleven trillion, four hundred fifty billion, one hundred thirty-one million, two hundred twelve thousand, three hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •