Base | Representation |
---|---|
bin | 10101100111011011… |
… | …001000001011101101 |
3 | 2012220112201012222121 |
4 | 111213123020023231 |
5 | 340013230014013 |
6 | 14355034512541 |
7 | 1451110516534 |
oct | 254733101355 |
9 | 65815635877 |
10 | 23210001133 |
11 | 9930493420 |
12 | 45b8b95751 |
13 | 225b7386a7 |
14 | 11a275531b |
15 | 90c99258d |
hex | 5676c82ed |
23210001133 has 16 divisors (see below), whose sum is σ = 27017755200. Its totient is φ = 19715633280.
The previous prime is 23210001131. The next prime is 23210001239. The reversal of 23210001133 is 33110001232.
It is a cyclic number.
It is not a de Polignac number, because 23210001133 - 21 = 23210001131 is a prime.
It is a super-2 number, since 2×232100011332 (a number of 22 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 (23210001131) 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 15 ways as a sum of consecutive naturals, for example, 745378 + ... + 775891.
It is an arithmetic number, because the mean of its divisors is an integer number (1688609700).
Almost surely, 223210001133 is an apocalyptic number.
It is an amenable number.
23210001133 is a deficient number, since it is larger than the sum of its proper divisors (3807754067).
23210001133 is a wasteful number, since it uses less digits than its factorization.
23210001133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1521372.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 23210001133 its reverse (33110001232), we get a palindrome (56320002365).
Subtracting 23210001133 from its reverse (33110001232), we obtain a palindrome (9900000099).
The spelling of 23210001133 in words is "twenty-three billion, two hundred ten million, one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •