Base | Representation |
---|---|
bin | 1010100110110000110110… |
… | …11101011010100110001111 |
3 | 10001120120111120000110100110 |
4 | 11103120123131122212033 |
5 | 11024102212034110411 |
6 | 121334012352131103 |
7 | 4624653125405301 |
oct | 523303335324617 |
9 | 101516446013313 |
10 | 23322133113231 |
11 | 7481952154627 |
12 | 2747b9b236a93 |
13 | 1002363230034 |
14 | 5a8b239a7971 |
15 | 2a69dee0d2a6 |
hex | 15361b75a98f |
23322133113231 has 4 divisors (see below), whose sum is σ = 31096177484312. Its totient is φ = 15548088742152.
The previous prime is 23322133113199. The next prime is 23322133113233. The reversal of 23322133113231 is 13231133122332.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 23322133113231 - 25 = 23322133113199 is a prime.
It is a super-2 number, since 2×233221331132312 (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 (23322133113233) 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, 3887022185536 + ... + 3887022185541.
It is an arithmetic number, because the mean of its divisors is an integer number (7774044371078).
Almost surely, 223322133113231 is an apocalyptic number.
23322133113231 is a deficient number, since it is larger than the sum of its proper divisors (7774044371081).
23322133113231 is an equidigital number, since it uses as much as digits as its factorization.
23322133113231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7774044371080.
The product of its digits is 11664, while the sum is 30.
Adding to 23322133113231 its reverse (13231133122332), we get a palindrome (36553266235563).
The spelling of 23322133113231 in words is "twenty-three trillion, three hundred twenty-two billion, one hundred thirty-three million, one hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •