Base | Representation |
---|---|
bin | 10010101101001000… |
… | …00010101011100011 |
3 | 221220212012210122110 |
4 | 21112210002223203 |
5 | 131031302121311 |
6 | 4340251410403 |
7 | 503566330020 |
oct | 112644025343 |
9 | 27825183573 |
10 | 10042223331 |
11 | 4293634028 |
12 | 1b43153a03 |
13 | c40681caa |
14 | 6b39d4547 |
15 | 3db94d8a6 |
hex | 256902ae3 |
10042223331 has 16 divisors (see below), whose sum is σ = 15325607168. Its totient is φ = 5729724000.
The previous prime is 10042223281. The next prime is 10042223339. The reversal of 10042223331 is 13332224001.
It is not a de Polignac number, because 10042223331 - 217 = 10042092259 is a prime.
It is a super-2 number, since 2×100422233312 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10042223298 and 10042223307.
It is not an unprimeable number, because it can be changed into a prime (10042223339) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 347845 + ... + 375606.
It is an arithmetic number, because the mean of its divisors is an integer number (957850448).
Almost surely, 210042223331 is an apocalyptic number.
10042223331 is a deficient number, since it is larger than the sum of its proper divisors (5283383837).
10042223331 is an equidigital number, since it uses as much as digits as its factorization.
10042223331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 724122.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 10042223331 its reverse (13332224001), we get a palindrome (23374447332).
It can be divided in two parts, 100422 and 23331, that added together give a triangular number (123753 = T497).
The spelling of 10042223331 in words is "ten billion, forty-two million, two hundred twenty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •