Base | Representation |
---|---|
bin | 101111111101111100… |
… | …0110100000011111010 |
3 | 100211212221220110222122 |
4 | 1133323320310003322 |
5 | 3141431104103310 |
6 | 115153334321242 |
7 | 10304455304621 |
oct | 1377370640372 |
9 | 324787813878 |
10 | 103010222330 |
11 | 3a760648754 |
12 | 17b69ab9222 |
13 | 9938362aa2 |
14 | 4db2b686b8 |
15 | 2a2d64c555 |
hex | 17fbe340fa |
103010222330 has 8 divisors (see below), whose sum is σ = 185418400212. Its totient is φ = 41204088928.
The previous prime is 103010222267. The next prime is 103010222347. The reversal of 103010222330 is 33222010301.
It can be written as a sum of positive squares in 2 ways, for example, as 102982586281 + 27636049 = 320909^2 + 5257^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1030102223302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103010222299 and 103010222308.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5150511107 + ... + 5150511126.
Almost surely, 2103010222330 is an apocalyptic number.
103010222330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103010222330 is a deficient number, since it is larger than the sum of its proper divisors (82408177882).
103010222330 is a wasteful number, since it uses less digits than its factorization.
103010222330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10301022240.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 103010222330 its reverse (33222010301), we get a palindrome (136232232631).
The spelling of 103010222330 in words is "one hundred three billion, ten million, two hundred twenty-two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •