Base | Representation |
---|---|
bin | 1010100110110001000001… |
… | …01001101000010010010111 |
3 | 10001120120201121212222110111 |
4 | 11103120200221220102113 |
5 | 11024102401332413421 |
6 | 121334025142503451 |
7 | 4624655233551646 |
oct | 523304051502227 |
9 | 101516647788414 |
10 | 23322220201111 |
11 | 7481997326a87 |
12 | 2748004434b87 |
13 | 10023782a2620 |
14 | 5a8b3139735d |
15 | 2a69e78b1ee1 |
hex | 153620a68497 |
23322220201111 has 32 divisors (see below), whose sum is σ = 25697799167040. Its totient is φ = 21033321753600.
The previous prime is 23322220201037. The next prime is 23322220201171. The reversal of 23322220201111 is 11110202222332.
It is not a de Polignac number, because 23322220201111 - 215 = 23322220168343 is a prime.
It is a super-2 number, since 2×233222202011112 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23322220201171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 160835901 + ... + 160980841.
It is an arithmetic number, because the mean of its divisors is an integer number (803056223970).
Almost surely, 223322220201111 is an apocalyptic number.
23322220201111 is a deficient number, since it is larger than the sum of its proper divisors (2375578965929).
23322220201111 is a wasteful number, since it uses less digits than its factorization.
23322220201111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145987.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 23322220201111 its reverse (11110202222332), we get a palindrome (34432422423443).
The spelling of 23322220201111 in words is "twenty-three trillion, three hundred twenty-two billion, two hundred twenty million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •