Base | Representation |
---|---|
bin | 110000000100111100… |
… | …1001100011001110000 |
3 | 100212111100001201221111 |
4 | 1200021321030121300 |
5 | 3142421232444211 |
6 | 115232531003104 |
7 | 10313340513622 |
oct | 1401171143160 |
9 | 325440051844 |
10 | 103245203056 |
11 | 3a8712531a6 |
12 | 18014739494 |
13 | 9974c47138 |
14 | 4dd6054c12 |
15 | 2a440b6421 |
hex | 1809e4c670 |
103245203056 has 80 divisors (see below), whose sum is σ = 213996017664. Its totient is φ = 48141665792.
The previous prime is 103245203053. The next prime is 103245203057. The reversal of 103245203056 is 650302542301.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103245203053) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4537500 + ... + 4560196.
Almost surely, 2103245203056 is an apocalyptic number.
103245203056 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 103245203056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (106998008832).
103245203056 is an abundant number, since it is smaller than the sum of its proper divisors (110750814608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103245203056 is a wasteful number, since it uses less digits than its factorization.
103245203056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23038 (or 23032 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 103245203056 its reverse (650302542301), we get a palindrome (753547745357).
The spelling of 103245203056 in words is "one hundred three billion, two hundred forty-five million, two hundred three thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •