Base | Representation |
---|---|
bin | 101111111110001111… |
… | …0000111010001001010 |
3 | 100211220122022020212210 |
4 | 1133330132013101022 |
5 | 3141441110002310 |
6 | 115154324045550 |
7 | 10304634361122 |
oct | 1377436072112 |
9 | 324818266783 |
10 | 103020000330 |
11 | 3a766117045 |
12 | 17b712338b6 |
13 | 993a3a75a0 |
14 | 4db4191c82 |
15 | 2a2e42e820 |
hex | 17fc78744a |
103020000330 has 32 divisors (see below), whose sum is σ = 266267078784. Its totient is φ = 25358769216.
The previous prime is 103020000329. The next prime is 103020000331. The reversal of 103020000330 is 33000020301.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (103020000329) and next prime (103020000331).
It is a super-2 number, since 2×1030200003302 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103020000331) 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, 132076534 + ... + 132077313.
It is an arithmetic number, because the mean of its divisors is an integer number (8320846212).
Almost surely, 2103020000330 is an apocalyptic number.
103020000330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103020000330 is an abundant number, since it is smaller than the sum of its proper divisors (163247078454).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103020000330 is a wasteful number, since it uses less digits than its factorization.
103020000330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264153870.
The product of its (nonzero) digits is 54, while the sum is 12.
Adding to 103020000330 its reverse (33000020301), we get a palindrome (136020020631).
The spelling of 103020000330 in words is "one hundred three billion, twenty million, three hundred thirty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •