Base | Representation |
---|---|
bin | 1011010111101010010110… |
… | …1000000010000011010001 |
3 | 1122021002121111021221110212 |
4 | 2311322211220002003101 |
5 | 3114304310143104121 |
6 | 42330535205333505 |
7 | 2430114513025442 |
oct | 265724550020321 |
9 | 48232544257425 |
10 | 12501133566161 |
11 | 3a8a778aa3339 |
12 | 149a978407295 |
13 | 6c8b0c641566 |
14 | 3130b559b2c9 |
15 | 16a2b331a25b |
hex | b5ea5a020d1 |
12501133566161 has 8 divisors (see below), whose sum is σ = 13216551235200. Its totient is φ = 11791462224240.
The previous prime is 12501133566143. The next prime is 12501133566197. The reversal of 12501133566161 is 16166533110521.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12501133566161 - 214 = 12501133549777 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12501133566121) 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, 1436577305 + ... + 1436586006.
It is an arithmetic number, because the mean of its divisors is an integer number (1652068904400).
Almost surely, 212501133566161 is an apocalyptic number.
It is an amenable number.
12501133566161 is a deficient number, since it is larger than the sum of its proper divisors (715417669039).
12501133566161 is a wasteful number, since it uses less digits than its factorization.
12501133566161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2873163559.
The product of its (nonzero) digits is 97200, while the sum is 41.
Adding to 12501133566161 its reverse (16166533110521), we get a palindrome (28667666676682).
The spelling of 12501133566161 in words is "twelve trillion, five hundred one billion, one hundred thirty-three million, five hundred sixty-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •