Base | Representation |
---|---|
bin | 11011101001101011100010… |
… | …111110100101001011111101 |
3 | 120221120221120101001112000001 |
4 | 123221223202332211023331 |
5 | 111414440334042400010 |
6 | 1110351320221234301 |
7 | 34421066431622131 |
oct | 3351534276451375 |
9 | 527527511045001 |
10 | 121611512075005 |
11 | 35827175184a77 |
12 | 11781161402991 |
13 | 52b1bbb39c5c4 |
14 | 22060586473c1 |
15 | e0d5db729c3a |
hex | 6e9ae2fa52fd |
121611512075005 has 4 divisors (see below), whose sum is σ = 145933814490012. Its totient is φ = 97289209660000.
The previous prime is 121611512074999. The next prime is 121611512075033. The reversal of 121611512075005 is 500570215116121.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 12729674929689 + 108881837145316 = 3567867^2 + 10434646^2 .
It is not a de Polignac number, because 121611512075005 - 231 = 121609364591357 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12161151207496 + ... + 12161151207505.
It is an arithmetic number, because the mean of its divisors is an integer number (36483453622503).
Almost surely, 2121611512075005 is an apocalyptic number.
It is an amenable number.
121611512075005 is a deficient number, since it is larger than the sum of its proper divisors (24322302415007).
121611512075005 is an equidigital number, since it uses as much as digits as its factorization.
121611512075005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24322302415006.
The product of its (nonzero) digits is 21000, while the sum is 37.
The spelling of 121611512075005 in words is "one hundred twenty-one trillion, six hundred eleven billion, five hundred twelve million, seventy-five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •