Base | Representation |
---|---|
bin | 101111111110001111… |
… | …0100101001111011110 |
3 | 100211220122112111021220 |
4 | 1133330132211033132 |
5 | 3141441122414402 |
6 | 115154330434210 |
7 | 10304635412061 |
oct | 1377436451736 |
9 | 324818474256 |
10 | 103020123102 |
11 | 3a7661a0306 |
12 | 17b71292966 |
13 | 993a41b430 |
14 | 4db41c48d8 |
15 | 2a2e455dbc |
hex | 17fc7a53de |
103020123102 has 64 divisors (see below), whose sum is σ = 229883330880. Its totient is φ = 30559785984.
The previous prime is 103020123077. The next prime is 103020123103. The reversal of 103020123102 is 201321020301.
It is a super-2 number, since 2×1030201231022 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103020123103) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1497738 + ... + 1565010.
It is an arithmetic number, because the mean of its divisors is an integer number (3591927045).
Almost surely, 2103020123102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 103020123102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (114941665440).
103020123102 is an abundant number, since it is smaller than the sum of its proper divisors (126863207778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103020123102 is a wasteful number, since it uses less digits than its factorization.
103020123102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67997.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 103020123102 its reverse (201321020301), we get a palindrome (304341143403).
The spelling of 103020123102 in words is "one hundred three billion, twenty million, one hundred twenty-three thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •