Base | Representation |
---|---|
bin | 1010001001010101011110… |
… | …10111001100110110111001 |
3 | 2220222220121002212120212101 |
4 | 11010222233113030312321 |
5 | 10411020413032331301 |
6 | 115241311040143401 |
7 | 4461626301614236 |
oct | 504525727146671 |
9 | 86886532776771 |
10 | 22311002230201 |
11 | 7122052126553 |
12 | 2604031607b61 |
13 | c5abc2ba2499 |
14 | 571c0314078d |
15 | 28a5613a2701 |
hex | 144aaf5ccdb9 |
22311002230201 has 8 divisors (see below), whose sum is σ = 22935176521344. Its totient is φ = 21695437239840.
The previous prime is 22311002230157. The next prime is 22311002230259. The reversal of 22311002230201 is 10203220011322.
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 22311002230201 - 223 = 22310993841593 is a prime.
It is a super-3 number, since 3×223110022302013 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22311002230261) 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, 2152319941 + ... + 2152330306.
It is an arithmetic number, because the mean of its divisors is an integer number (2866897065168).
Almost surely, 222311002230201 is an apocalyptic number.
It is an amenable number.
22311002230201 is a deficient number, since it is larger than the sum of its proper divisors (624174291143).
22311002230201 is an equidigital number, since it uses as much as digits as its factorization.
22311002230201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4304650391.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 22311002230201 its reverse (10203220011322), we get a palindrome (32514222241523).
The spelling of 22311002230201 in words is "twenty-two trillion, three hundred eleven billion, two million, two hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •