Base | Representation |
---|---|
bin | 110000000001010010… |
… | …0010111100000110110 |
3 | 100212011202210202210200 |
4 | 1200002210113200312 |
5 | 3142143302144110 |
6 | 115212420501330 |
7 | 10310316053535 |
oct | 1400244274066 |
9 | 325152722720 |
10 | 103122303030 |
11 | 3a80894062a |
12 | 17b9b54a846 |
13 | 9955646226 |
14 | 4dc39c231c |
15 | 2a383db6c0 |
hex | 1802917836 |
103122303030 has 48 divisors (see below), whose sum is σ = 268204626144. Its totient is φ = 27490394880.
The previous prime is 103122303029. The next prime is 103122303041. The reversal of 103122303030 is 30303221301.
It is a super-2 number, since 2×1031223030302 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 103122302994 and 103122303012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 97327 + ... + 464453.
It is an arithmetic number, because the mean of its divisors is an integer number (5587596378).
Almost surely, 2103122303030 is an apocalyptic number.
103122303030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103122303030 is an abundant number, since it is smaller than the sum of its proper divisors (165082323114).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103122303030 is a wasteful number, since it uses less digits than its factorization.
103122303030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 370261 (or 370258 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 103122303030 its reverse (30303221301), we get a palindrome (133425524331).
The spelling of 103122303030 in words is "one hundred three billion, one hundred twenty-two million, three hundred three thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •