Base | Representation |
---|---|
bin | 110000000100010000… |
… | …1100010001001000111 |
3 | 100212102201211020211021 |
4 | 1200020201202021013 |
5 | 3142344342122211 |
6 | 115230350252011 |
7 | 10312641264625 |
oct | 1401041421107 |
9 | 325381736737 |
10 | 103222223431 |
11 | 3a85a288278 |
12 | 18008ab7007 |
13 | 997025c722 |
14 | 4dd2d92515 |
15 | 2a42077771 |
hex | 1808862247 |
103222223431 has 4 divisors (see below), whose sum is σ = 103614703632. Its totient is φ = 102829743232.
The previous prime is 103222223359. The next prime is 103222223473. The reversal of 103222223431 is 134322222301.
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 103222223431 - 29 = 103222222919 is a prime.
It is a super-2 number, since 2×1032222234312 (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 = 103222223396 and 103222223405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103222223231) 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, 196239706 + ... + 196240231.
It is an arithmetic number, because the mean of its divisors is an integer number (25903675908).
Almost surely, 2103222223431 is an apocalyptic number.
103222223431 is a deficient number, since it is larger than the sum of its proper divisors (392480201).
103222223431 is an equidigital number, since it uses as much as digits as its factorization.
103222223431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 392480200.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 103222223431 its reverse (134322222301), we get a palindrome (237544445732).
The spelling of 103222223431 in words is "one hundred three billion, two hundred twenty-two million, two hundred twenty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •