Base | Representation |
---|---|
bin | 10010110100100000… |
… | …00110010100011111 |
3 | 222002011122200021100 |
4 | 21122100012110133 |
5 | 131143122313343 |
6 | 4350342004143 |
7 | 505250316543 |
oct | 113220062437 |
9 | 28064580240 |
10 | 10104104223 |
11 | 431555a064 |
12 | 1b5ba16653 |
13 | c5043a0c5 |
14 | 6bbd01a23 |
15 | 3e20c39d3 |
hex | 25a40651f |
10104104223 has 12 divisors (see below), whose sum is σ = 15098087160. Its totient is φ = 6503791056.
The previous prime is 10104104209. The next prime is 10104104237. The reversal of 10104104223 is 32240140101.
It is an interprime number because it is at equal distance from previous prime (10104104209) and next prime (10104104237).
It is not a de Polignac number, because 10104104223 - 218 = 10103842079 is a prime.
It is a super-3 number, since 3×101041042233 (a number of 31 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10104104196 and 10104104205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10104104243) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 19356261 + ... + 19356782.
It is an arithmetic number, because the mean of its divisors is an integer number (1258173930).
Almost surely, 210104104223 is an apocalyptic number.
10104104223 is a deficient number, since it is larger than the sum of its proper divisors (4993982937).
10104104223 is a wasteful number, since it uses less digits than its factorization.
10104104223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38713078 (or 38713075 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 10104104223 its reverse (32240140101), we get a palindrome (42344244324).
The spelling of 10104104223 in words is "ten billion, one hundred four million, one hundred four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •