Base | Representation |
---|---|
bin | 10111011111101100100011… |
… | …111000001101011111000100 |
3 | 111112212120002210000101112110 |
4 | 113133230203320031133010 |
5 | 102021002413322043244 |
6 | 1003434343113421020 |
7 | 30523402344465306 |
oct | 2737544370153704 |
9 | 445776083011473 |
10 | 103333220112324 |
11 | 2aa1a410953234 |
12 | b70a80640a770 |
13 | 458738602a937 |
14 | 1b734d6bd7976 |
15 | be2e02d6d9b9 |
hex | 5dfb23e0d7c4 |
103333220112324 has 24 divisors (see below), whose sum is σ = 246991599294048. Its totient is φ = 33604299223360.
The previous prime is 103333220112323. The next prime is 103333220112329. The reversal of 103333220112324 is 423211022333301.
It is a junction number, because it is equal to n+sod(n) for n = 103333220112291 and 103333220112300.
It is not an unprimeable number, because it can be changed into a prime (103333220112323) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 105013434582 + ... + 105013435565.
It is an arithmetic number, because the mean of its divisors is an integer number (10291316637252).
Almost surely, 2103333220112324 is an apocalyptic number.
It is an amenable number.
103333220112324 is an abundant number, since it is smaller than the sum of its proper divisors (143658379181724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103333220112324 is a wasteful number, since it uses less digits than its factorization.
103333220112324 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210026870195 (or 210026870193 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 30.
Adding to 103333220112324 its reverse (423211022333301), we get a palindrome (526544242445625).
The spelling of 103333220112324 in words is "one hundred three trillion, three hundred thirty-three billion, two hundred twenty million, one hundred twelve thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •