Base | Representation |
---|---|
bin | 1011000011000100111101… |
… | …1101111100010000001001 |
3 | 1121000021211012210011211010 |
4 | 2300301033131330100021 |
5 | 3043011040143341441 |
6 | 41500252415154133 |
7 | 2362425251550654 |
oct | 260611735742011 |
9 | 47007735704733 |
10 | 12147500762121 |
11 | 39637a954a5aa |
12 | 1442325515949 |
13 | 6a167324875a |
14 | 2ddd2947a89b |
15 | 160eb73c5116 |
hex | b0c4f77c409 |
12147500762121 has 4 divisors (see below), whose sum is σ = 16196667682832. Its totient is φ = 8098333841412.
The previous prime is 12147500762107. The next prime is 12147500762153. The reversal of 12147500762121 is 12126700574121.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 12147500762121 - 27 = 12147500761993 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 12147500762121.
It is not an unprimeable number, because it can be changed into a prime (12147500762101) 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, 2024583460351 + ... + 2024583460356.
It is an arithmetic number, because the mean of its divisors is an integer number (4049166920708).
Almost surely, 212147500762121 is an apocalyptic number.
It is an amenable number.
12147500762121 is a deficient number, since it is larger than the sum of its proper divisors (4049166920711).
12147500762121 is an equidigital number, since it uses as much as digits as its factorization.
12147500762121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4049166920710.
The product of its (nonzero) digits is 47040, while the sum is 39.
The spelling of 12147500762121 in words is "twelve trillion, one hundred forty-seven billion, five hundred million, seven hundred sixty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •