Base | Representation |
---|---|
bin | 1010100011001101100101… |
… | …00000000011100011011111 |
3 | 10001010220112202212012220011 |
4 | 11101212302200003203133 |
5 | 11020102312424111221 |
6 | 121201552420104051 |
7 | 4613103300462301 |
oct | 521466240034337 |
9 | 101126482765804 |
10 | 23200113113311 |
11 | 7435127032692 |
12 | 2728406b35027 |
13 | cc39b86b8254 |
14 | 5a2c6a27b971 |
15 | 2a374c9441e1 |
hex | 1519b28038df |
23200113113311 has 8 divisors (see below), whose sum is σ = 24000687824400. Its totient is φ = 22399576456320.
The previous prime is 23200113113293. The next prime is 23200113113323. The reversal of 23200113113311 is 11331131100232.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23200113113311 is a prime.
It is a super-2 number, since 2×232001131133112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23200113113341) 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, 8270410 + ... + 10714471.
It is an arithmetic number, because the mean of its divisors is an integer number (3000085978050).
Almost surely, 223200113113311 is an apocalyptic number.
23200113113311 is a deficient number, since it is larger than the sum of its proper divisors (800574711089).
23200113113311 is a wasteful number, since it uses less digits than its factorization.
23200113113311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19027049.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 23200113113311 its reverse (11331131100232), we get a palindrome (34531244213543).
The spelling of 23200113113311 in words is "twenty-three trillion, two hundred billion, one hundred thirteen million, one hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •