Base | Representation |
---|---|
bin | 100001111000011010011100… |
… | …100000000010100010011001 |
3 | 201112121102120220001002221002 |
4 | 201320122130200002202121 |
5 | 124012404012034341441 |
6 | 1244531134100154345 |
7 | 43246530514661315 |
oct | 4170323440024231 |
9 | 645542526032832 |
10 | 149012221012121 |
11 | 43530801025695 |
12 | 148676973989b5 |
13 | 651ba3b4681bc |
14 | 28b23310c2b45 |
15 | 123623aa43b9b |
hex | 87869c802899 |
149012221012121 has 8 divisors (see below), whose sum is σ = 149055983960520. Its totient is φ = 148968459940608.
The previous prime is 149012221012063. The next prime is 149012221012147. The reversal of 149012221012121 is 121210122210941.
It can be written as a sum of positive squares in 4 ways, for example, as 290293586521 + 148721927425600 = 538789^2 + 12195160^2 .
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 149012221012121 - 226 = 149012153903257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (149012221012181) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 167092235 + ... + 167981663.
It is an arithmetic number, because the mean of its divisors is an integer number (18631997995065).
Almost surely, 2149012221012121 is an apocalyptic number.
It is an amenable number.
149012221012121 is a deficient number, since it is larger than the sum of its proper divisors (43762948399).
149012221012121 is an equidigital number, since it uses as much as digits as its factorization.
149012221012121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 938443.
The product of its (nonzero) digits is 1152, while the sum is 29.
The spelling of 149012221012121 in words is "one hundred forty-nine trillion, twelve billion, two hundred twenty-one million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •