Base | Representation |
---|---|
bin | 110000000001001001… |
… | …0101010100000001110 |
3 | 100212011110001222210220 |
4 | 1200002102222200032 |
5 | 3142141110142342 |
6 | 115212133212210 |
7 | 10310231444511 |
oct | 1400222524016 |
9 | 325143058726 |
10 | 103117662222 |
11 | 3a806260953 |
12 | 17b99a91066 |
13 | 99546acaa3 |
14 | 4dc3134d78 |
15 | 2a37cc15ec |
hex | 18024aa80e |
103117662222 has 8 divisors (see below), whose sum is σ = 206235324456. Its totient is φ = 34372554072.
The previous prime is 103117662217. The next prime is 103117662227. The reversal of 103117662222 is 222266711301.
103117662222 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (103117662217) and next prime (103117662227).
It is a sphenic number, since it is the product of 3 distinct primes.
103117662222 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103117662227) 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, 8593138513 + ... + 8593138524.
It is an arithmetic number, because the mean of its divisors is an integer number (25779415557).
Almost surely, 2103117662222 is an apocalyptic number.
103117662222 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103117662222 is a wasteful number, since it uses less digits than its factorization.
103117662222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17186277042.
The product of its (nonzero) digits is 12096, while the sum is 33.
The spelling of 103117662222 in words is "one hundred three billion, one hundred seventeen million, six hundred sixty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •