Base | Representation |
---|---|
bin | 11011100011111111000001… |
… | …101010110100000100000101 |
3 | 120220012112021222022000200211 |
4 | 123203333001222310010011 |
5 | 111342032241433032442 |
6 | 1105451430022435421 |
7 | 34350602234352445 |
oct | 3343770152640405 |
9 | 526175258260624 |
10 | 121220111220997 |
11 | 356961846452a8 |
12 | 11719329b92b71 |
13 | 5284013461339 |
14 | 21d1128552125 |
15 | e0332ec2b617 |
hex | 6e3fc1ab4105 |
121220111220997 has 8 divisors (see below), whose sum is σ = 123031186900544. Its totient is φ = 119421231337728.
The previous prime is 121220111220983. The next prime is 121220111221007. The reversal of 121220111220997 is 799022111022121.
It is a happy number.
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 121220111220997 - 215 = 121220111188229 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121220111220907) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3048929043 + ... + 3048968800.
It is an arithmetic number, because the mean of its divisors is an integer number (15378898362568).
Almost surely, 2121220111220997 is an apocalyptic number.
It is an amenable number.
121220111220997 is a deficient number, since it is larger than the sum of its proper divisors (1811075679547).
121220111220997 is a wasteful number, since it uses less digits than its factorization.
121220111220997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6097898139.
The product of its (nonzero) digits is 18144, while the sum is 40.
The spelling of 121220111220997 in words is "one hundred twenty-one trillion, two hundred twenty billion, one hundred eleven million, two hundred twenty thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •