Base | Representation |
---|---|
bin | 110000000111011110… |
… | …1011110110100000000 |
3 | 100212201021000200211101 |
4 | 1200032331132310000 |
5 | 3143110013304440 |
6 | 115245205024144 |
7 | 10315422214441 |
oct | 1401675366400 |
9 | 325637020741 |
10 | 103330213120 |
11 | 3a905236552 |
12 | 180390b5054 |
13 | 998973ca54 |
14 | 50034632c8 |
15 | 2a4b7a969a |
hex | 180ef5ed00 |
103330213120 has 72 divisors (see below), whose sum is σ = 251565851880. Its totient is φ = 40654479360.
The previous prime is 103330213109. The next prime is 103330213153. The reversal of 103330213120 is 21312033301.
It can be written as a sum of positive squares in 4 ways, for example, as 88811776 + 103241401344 = 9424^2 + 321312^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 583615 + ... + 739774.
It is an arithmetic number, because the mean of its divisors is an integer number (3493970165).
Almost surely, 2103330213120 is an apocalyptic number.
103330213120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103330213120 is an abundant number, since it is smaller than the sum of its proper divisors (148235638760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103330213120 is an equidigital number, since it uses as much as digits as its factorization.
103330213120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1323471 (or 1323457 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 103330213120 its reverse (21312033301), we get a palindrome (124642246421).
The spelling of 103330213120 in words is "one hundred three billion, three hundred thirty million, two hundred thirteen thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •