Base | Representation |
---|---|
bin | 10111011011000001011111… |
… | …110100110111101001011000 |
3 | 111111201212020121010021111102 |
4 | 113123001133310313221120 |
5 | 102000222241422302300 |
6 | 1003031035034250532 |
7 | 30461243644013102 |
oct | 2733013764675130 |
9 | 444655217107442 |
10 | 103012103322200 |
11 | 2a906207894a76 |
12 | b678528b86a48 |
13 | 4562ccc345357 |
14 | 1b61b53340572 |
15 | bd98ab8930d5 |
hex | 5db05fd37a58 |
103012103322200 has 96 divisors (see below), whose sum is σ = 245982513767760. Its totient is φ = 40090167590400.
The previous prime is 103012103322199. The next prime is 103012103322239. The reversal of 103012103322200 is 2223301210301.
It is a super-2 number, since 2×1030121033222002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 329017730 + ... + 329330670.
Almost surely, 2103012103322200 is an apocalyptic number.
103012103322200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103012103322200 is an abundant number, since it is smaller than the sum of its proper divisors (142970410445560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103012103322200 is a wasteful number, since it uses less digits than its factorization.
103012103322200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 357477 (or 357468 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 103012103322200 its reverse (2223301210301), we get a palindrome (105235404532501).
The spelling of 103012103322200 in words is "one hundred three trillion, twelve billion, one hundred three million, three hundred twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •