Base | Representation |
---|---|
bin | 10111011111010000101110… |
… | …010010111100100100010000 |
3 | 111112202200221200201120001210 |
4 | 113133100232102330210100 |
5 | 102020010210002401000 |
6 | 1003412521131300120 |
7 | 30521263551661341 |
oct | 2737205622744420 |
9 | 445680850646053 |
10 | 103303330122000 |
11 | 2aa08772818098 |
12 | b704a642aa640 |
13 | 45846016a2428 |
14 | 1b71c9d2280c8 |
15 | be2253c25350 |
hex | 5df42e4bc910 |
103303330122000 has 160 divisors (see below), whose sum is σ = 335480960415744. Its totient is φ = 27346477440000.
The previous prime is 103303330121987. The next prime is 103303330122037. The reversal of 103303330122000 is 221033303301.
103303330122000 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 31 ways as a sum of consecutive naturals, for example, 62014576 + ... + 63658575.
Almost surely, 2103303330122000 is an apocalyptic number.
103303330122000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103303330122000 is an abundant number, since it is smaller than the sum of its proper divisors (232177630293744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103303330122000 is a wasteful number, since it uses less digits than its factorization.
103303330122000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125673314 (or 125673298 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 103303330122000 its reverse (221033303301), we get a palindrome (103524363425301).
The spelling of 103303330122000 in words is "one hundred three trillion, three hundred three billion, three hundred thirty million, one hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •