Base | Representation |
---|---|
bin | 101111111110101001… |
… | …1101101101101001000 |
3 | 100211221121202010022210 |
4 | 1133331103231231020 |
5 | 3142003204121100 |
6 | 115155545145120 |
7 | 10305164662260 |
oct | 1377523555510 |
9 | 324847663283 |
10 | 103034051400 |
11 | 3a7730438a5 |
12 | 17b75a8b1a0 |
13 | 9940287027 |
14 | 4db5dac7a0 |
15 | 2a307a7c50 |
hex | 17fd4edb48 |
103034051400 has 96 divisors (see below), whose sum is σ = 365034939840. Its totient is φ = 23550639360.
The previous prime is 103034051383. The next prime is 103034051429. The reversal of 103034051400 is 4150430301.
It is a super-3 number, since 3×1030340514003 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12261759 + ... + 12270158.
It is an arithmetic number, because the mean of its divisors is an integer number (3802447290).
Almost surely, 2103034051400 is an apocalyptic number.
103034051400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103034051400 is an abundant number, since it is smaller than the sum of its proper divisors (262000888440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103034051400 is a wasteful number, since it uses less digits than its factorization.
103034051400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24531943 (or 24531934 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 21.
Adding to 103034051400 its reverse (4150430301), we get a palindrome (107184481701).
The spelling of 103034051400 in words is "one hundred three billion, thirty-four million, fifty-one thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •