Base | Representation |
---|---|
bin | 110000011110110100… |
… | …0110011100011110111 |
3 | 100221201211120202120112 |
4 | 1200331220303203313 |
5 | 3201211002302411 |
6 | 115455021453235 |
7 | 10344011431412 |
oct | 1407550634367 |
9 | 327654522515 |
10 | 104113322231 |
11 | 4017728aa66 |
12 | 1821741121b |
13 | 9a82a5a719 |
14 | 5079472b79 |
15 | 2a953e6b8b |
hex | 183da338f7 |
104113322231 has 4 divisors (see below), whose sum is σ = 104177870232. Its totient is φ = 104048774232.
The previous prime is 104113322219. The next prime is 104113322249. The reversal of 104113322231 is 132223311401.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 104113322231 - 218 = 104113060087 is a prime.
It is a super-2 number, since 2×1041133222312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104113322197 and 104113322206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104113321231) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32271581 + ... + 32274806.
It is an arithmetic number, because the mean of its divisors is an integer number (26044467558).
Almost surely, 2104113322231 is an apocalyptic number.
104113322231 is a deficient number, since it is larger than the sum of its proper divisors (64548001).
104113322231 is an equidigital number, since it uses as much as digits as its factorization.
104113322231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64548000.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 104113322231 its reverse (132223311401), we get a palindrome (236336633632).
The spelling of 104113322231 in words is "one hundred four billion, one hundred thirteen million, three hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •