Base | Representation |
---|---|
bin | 101111111101101011… |
… | …0011001110101101110 |
3 | 100211212022221012110110 |
4 | 1133323112121311232 |
5 | 3141421301431110 |
6 | 115152413120450 |
7 | 10304315525436 |
oct | 1377326316556 |
9 | 324768835413 |
10 | 103001202030 |
11 | 3a756547661 |
12 | 17b66a89126 |
13 | 993652512c |
14 | 4db189b2c6 |
15 | 2a2c969a20 |
hex | 17fb599d6e |
103001202030 has 32 divisors (see below), whose sum is σ = 247278009888. Its totient is φ = 27458640000.
The previous prime is 103001202001. The next prime is 103001202037. The reversal of 103001202030 is 30202100301.
It is a happy number.
It is a super-2 number, since 2×1030012020302 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 103001201997 and 103001202015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103001202037) 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, 421021 + ... + 619080.
It is an arithmetic number, because the mean of its divisors is an integer number (7727437809).
Almost surely, 2103001202030 is an apocalyptic number.
103001202030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103001202030 is an abundant number, since it is smaller than the sum of its proper divisors (144276807858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103001202030 is a wasteful number, since it uses less digits than its factorization.
103001202030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1043412.
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 103001202030 its reverse (30202100301), we get a palindrome (133203302331).
The spelling of 103001202030 in words is "one hundred three billion, one million, two hundred two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •