Base | Representation |
---|---|
bin | 11011100010010001001110… |
… | …110100010001000100111101 |
3 | 120212210020222221112202200001 |
4 | 123202101032310101010331 |
5 | 111333114321332433201 |
6 | 1105321331505034301 |
7 | 34336226624261542 |
oct | 3342211664210475 |
9 | 525706887482601 |
10 | 121102220202301 |
11 | 356501881a3038 |
12 | 116ba508625991 |
13 | 5275b7618ab00 |
14 | 21c9543352bc9 |
15 | e0022eeb4301 |
hex | 6e244ed1113d |
121102220202301 has 24 divisors (see below), whose sum is σ = 141402900925440. Its totient is φ = 103320152208000.
The previous prime is 121102220202233. The next prime is 121102220202331. The reversal of 121102220202301 is 103202022201121.
It is not a de Polignac number, because 121102220202301 - 29 = 121102220201789 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121102220202331) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 459804925 + ... + 460068226.
It is an arithmetic number, because the mean of its divisors is an integer number (5891787538560).
Almost surely, 2121102220202301 is an apocalyptic number.
It is an amenable number.
121102220202301 is a deficient number, since it is larger than the sum of its proper divisors (20300680723139).
121102220202301 is a wasteful number, since it uses less digits than its factorization.
121102220202301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 919873237 (or 919873224 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 121102220202301 its reverse (103202022201121), we get a palindrome (224304242403422).
The spelling of 121102220202301 in words is "one hundred twenty-one trillion, one hundred two billion, two hundred twenty million, two hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •