Base | Representation |
---|---|
bin | 101111111101111111… |
… | …1101001000010111100 |
3 | 100211220002021102020212 |
4 | 1133323333221002330 |
5 | 3141432033342340 |
6 | 115153440531552 |
7 | 10304506441145 |
oct | 1377377510274 |
9 | 324802242225 |
10 | 103012012220 |
11 | 3a7616604a7 |
12 | 17b6a620bb8 |
13 | 993883b6b0 |
14 | 4db30b2acc |
15 | 2a2d8a2a65 |
hex | 17fbfe90bc |
103012012220 has 48 divisors (see below), whose sum is σ = 243094582080. Its totient is φ = 36381497856.
The previous prime is 103012012219. The next prime is 103012012241. The reversal of 103012012220 is 22210210301.
It is a happy number.
It is a super-2 number, since 2×1030120122202 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103012012195 and 103012012204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8607065 + ... + 8619024.
It is an arithmetic number, because the mean of its divisors is an integer number (5064470460).
Almost surely, 2103012012220 is an apocalyptic number.
103012012220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103012012220 is an abundant number, since it is smaller than the sum of its proper divisors (140082569860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103012012220 is a wasteful number, since it uses less digits than its factorization.
103012012220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17226134 (or 17226132 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 103012012220 its reverse (22210210301), we get a palindrome (125222222521).
The spelling of 103012012220 in words is "one hundred three billion, twelve million, twelve thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •