Base | Representation |
---|---|
bin | 1010100001010001001001… |
… | …10011011001110100000111 |
3 | 10000220112010020111001121221 |
4 | 11100220210303121310013 |
5 | 11013004010143423421 |
6 | 121111144013421211 |
7 | 4605220006515421 |
oct | 520504463316407 |
9 | 100815106431557 |
10 | 23133311311111 |
11 | 74098671729a1 |
12 | 271748319a807 |
13 | cba600a2b041 |
14 | 59d930301811 |
15 | 2a1b3cec7841 |
hex | 150a24cd9d07 |
23133311311111 has 8 divisors (see below), whose sum is σ = 23218203384320. Its totient is φ = 23048489198592.
The previous prime is 23133311311091. The next prime is 23133311311171. The reversal of 23133311311111 is 11111311333132.
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 23133311311111 - 25 = 23133311311079 is a prime.
It is a super-2 number, since 2×231333113111112 (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 (23133311311171) 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, 16827591 + ... + 18150328.
It is an arithmetic number, because the mean of its divisors is an integer number (2902275423040).
Almost surely, 223133311311111 is an apocalyptic number.
23133311311111 is a deficient number, since it is larger than the sum of its proper divisors (84892073209).
23133311311111 is a wasteful number, since it uses less digits than its factorization.
23133311311111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34980345.
The product of its digits is 486, while the sum is 25.
Adding to 23133311311111 its reverse (11111311333132), we get a palindrome (34244622644243).
The spelling of 23133311311111 in words is "twenty-three trillion, one hundred thirty-three billion, three hundred eleven million, three hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •