Base | Representation |
---|---|
bin | 110000000101001010… |
… | …0001000000110000000 |
3 | 100212111211100102202212 |
4 | 1200022110020012000 |
5 | 3142430034411141 |
6 | 115233342201252 |
7 | 10313454520460 |
oct | 1401224100600 |
9 | 325454312685 |
10 | 103252263296 |
11 | 3a875235706 |
12 | 18016b83228 |
13 | 99765498b0 |
14 | 4dd6d71ba0 |
15 | 2a44a0d2eb |
hex | 180a508180 |
103252263296 has 256 divisors, whose sum is σ = 257319659520. Its totient is φ = 40183603200.
The previous prime is 103252263287. The next prime is 103252263311. The reversal of 103252263296 is 692362252301.
It is a super-2 number, since 2×1032522632962 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 239564201 + ... + 239564631.
It is an arithmetic number, because the mean of its divisors is an integer number (1005154920).
Almost surely, 2103252263296 is an apocalyptic number.
103252263296 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 103252263296, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (128659829760).
103252263296 is an abundant number, since it is smaller than the sum of its proper divisors (154067396224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103252263296 is a wasteful number, since it uses less digits than its factorization.
103252263296 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 753 (or 741 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 41.
The spelling of 103252263296 in words is "one hundred three billion, two hundred fifty-two million, two hundred sixty-three thousand, two hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •