Base | Representation |
---|---|
bin | 10011010000111000… |
… | …01001100011101001 |
3 | 222200202120100210000 |
4 | 21220130021203221 |
5 | 132140042103413 |
6 | 4430124013213 |
7 | 514200530001 |
oct | 115034114351 |
9 | 28622510700 |
10 | 10342144233 |
11 | 4427964043 |
12 | 2007691209 |
13 | c8a852a95 |
14 | 701787001 |
15 | 407e44073 |
hex | 2687098e9 |
10342144233 has 10 divisors (see below), whose sum is σ = 15449376074. Its totient is φ = 6894762768.
The previous prime is 10342144231. The next prime is 10342144243. The reversal of 10342144233 is 33244124301.
10342144233 is a `hidden beast` number, since 1 + 0 + 3 + 421 + 4 + 4 + 233 = 666.
It can be written as a sum of positive squares in only one way, i.e., 8473570704 + 1868573529 = 92052^2 + 43227^2 .
It is not a de Polignac number, because 10342144233 - 21 = 10342144231 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10342144197 and 10342144206.
It is not an unprimeable number, because it can be changed into a prime (10342144231) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 63840316 + ... + 63840477.
Almost surely, 210342144233 is an apocalyptic number.
It is an amenable number.
10342144233 is a deficient number, since it is larger than the sum of its proper divisors (5107231841).
10342144233 is an equidigital number, since it uses as much as digits as its factorization.
10342144233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127680805 (or 127680796 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 10342144233 its reverse (33244124301), we get a palindrome (43586268534).
The spelling of 10342144233 in words is "ten billion, three hundred forty-two million, one hundred forty-four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •