Base | Representation |
---|---|
bin | 10111011100011110101010… |
… | …000100111101110000000100 |
3 | 111112002102102212011211002020 |
4 | 113130132222010331300010 |
5 | 102003342122111201200 |
6 | 1003145020552043140 |
7 | 30501414533561052 |
oct | 2734365204756004 |
9 | 445072385154066 |
10 | 103112133303300 |
11 | 2a944679138340 |
12 | b6939a49934b0 |
13 | 456c581121294 |
14 | 1b669223671d2 |
15 | bdc2b3550ea0 |
hex | 5dc7aa13dc04 |
103112133303300 has 144 divisors (see below), whose sum is σ = 325467496913664. Its totient is φ = 24996258000000.
The previous prime is 103112133303287. The next prime is 103112133303419. The reversal of 103112133303300 is 3303331211301.
It is a super-2 number, since 2×1031121333033002 (a number of 29 digits) contains 22 as substring.
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 47 ways as a sum of consecutive naturals, for example, 139720275 + ... + 140456325.
Almost surely, 2103112133303300 is an apocalyptic number.
103112133303300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103112133303300 is an abundant number, since it is smaller than the sum of its proper divisors (222355363610364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103112133303300 is a wasteful number, since it uses less digits than its factorization.
103112133303300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 778530 (or 778523 counting only the distinct ones).
The product of its (nonzero) digits is 1458, while the sum is 24.
Adding to 103112133303300 its reverse (3303331211301), we get a palindrome (106415464514601).
The spelling of 103112133303300 in words is "one hundred three trillion, one hundred twelve billion, one hundred thirty-three million, three hundred three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •