Base | Representation |
---|---|
bin | 10111011110000110000110… |
… | …001100011110101111010110 |
3 | 111112111001010022121010101212 |
4 | 113132012012030132233112 |
5 | 102012202103303141400 |
6 | 1003312030022221422 |
7 | 30512426063645021 |
oct | 2736060614365726 |
9 | 445431108533355 |
10 | 103223200443350 |
11 | 2a987793699579 |
12 | b6b1420b84872 |
13 | 4579ba17351b0 |
14 | 1b6c05b1741b8 |
15 | be011418d335 |
hex | 5de18631ebd6 |
103223200443350 has 48 divisors (see below), whose sum is σ = 206799429197760. Its totient is φ = 38106652953600.
The previous prime is 103223200443283. The next prime is 103223200443359. The reversal of 103223200443350 is 53344002322301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103223200443359) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9803291 + ... + 17393990.
It is an arithmetic number, because the mean of its divisors is an integer number (4308321441620).
Almost surely, 2103223200443350 is an apocalyptic number.
103223200443350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103223200443350 is an abundant number, since it is smaller than the sum of its proper divisors (103576228754410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103223200443350 is a wasteful number, since it uses less digits than its factorization.
103223200443350 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27203145 (or 27203140 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 32.
Adding to 103223200443350 its reverse (53344002322301), we get a palindrome (156567202765651).
The spelling of 103223200443350 in words is "one hundred three trillion, two hundred twenty-three billion, two hundred million, four hundred forty-three thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •