Base | Representation |
---|---|
bin | 1010100001010000111110… |
… | …11111011110111010000011 |
3 | 10000220111220000210220021221 |
4 | 11100220133133132322003 |
5 | 11013003314340444021 |
6 | 121111131111455511 |
7 | 4605214545226144 |
oct | 520503737367203 |
9 | 100814800726257 |
10 | 23133222203011 |
11 | 7409820940738 |
12 | 2717459387597 |
13 | cba5b842c05b |
14 | 59d922547acb |
15 | 2a1b35275241 |
hex | 150a1f7dee83 |
23133222203011 has 4 divisors (see below), whose sum is σ = 23758444424752. Its totient is φ = 22507999981272.
The previous prime is 23133222202969. The next prime is 23133222203017. The reversal of 23133222203011 is 11030222233132.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 23133222203011 - 221 = 23133220105859 is a prime.
It is a super-2 number, since 2×231332222030112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23133222203017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 312611110815 + ... + 312611110888.
It is an arithmetic number, because the mean of its divisors is an integer number (5939611106188).
Almost surely, 223133222203011 is an apocalyptic number.
23133222203011 is a deficient number, since it is larger than the sum of its proper divisors (625222221741).
23133222203011 is an equidigital number, since it uses as much as digits as its factorization.
23133222203011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 625222221740.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 23133222203011 its reverse (11030222233132), we get a palindrome (34163444436143).
The spelling of 23133222203011 in words is "twenty-three trillion, one hundred thirty-three billion, two hundred twenty-two million, two hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •