Base | Representation |
---|---|
bin | 10010110111110110… |
… | …11001110000000111 |
3 | 222011010120210000011 |
4 | 21123323121300013 |
5 | 131222322430343 |
6 | 4353224531051 |
7 | 506041363360 |
oct | 113373316007 |
9 | 28133523004 |
10 | 10132233223 |
11 | 432a421872 |
12 | 1b69320a87 |
13 | c56208598 |
14 | 6c1944b67 |
15 | 3e47cd29d |
hex | 25bed9c07 |
10132233223 has 16 divisors (see below), whose sum is σ = 12656369664. Its totient is φ = 7910225280.
The previous prime is 10132233203. The next prime is 10132233247. The reversal of 10132233223 is 32233223101.
It is a cyclic number.
It is not a de Polignac number, because 10132233223 - 25 = 10132233191 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10132233194 and 10132233203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10132233203) 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, 1369615 + ... + 1376992.
It is an arithmetic number, because the mean of its divisors is an integer number (791023104).
Almost surely, 210132233223 is an apocalyptic number.
10132233223 is a deficient number, since it is larger than the sum of its proper divisors (2524136441).
10132233223 is a wasteful number, since it uses less digits than its factorization.
10132233223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2746662.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 10132233223 its reverse (32233223101), we get a palindrome (42365456324).
It can be divided in two parts, 101 and 32233223, that multiplied together give a palindrome (3255555523).
The spelling of 10132233223 in words is "ten billion, one hundred thirty-two million, two hundred thirty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •