Base | Representation |
---|---|
bin | 10111011111100000011101… |
… | …000010011010011001001000 |
3 | 111112211022112210211211100212 |
4 | 113133200131002122121020 |
5 | 102020244302413203412 |
6 | 1003424353133420252 |
7 | 30522432244232321 |
oct | 2737403502323110 |
9 | 445738483754325 |
10 | 103320220444232 |
11 | 2aa1494a985190 |
12 | b70819893a688 |
13 | 4586093a4403c |
14 | 1b72a22517448 |
15 | be28e1985222 |
hex | 5df81d09a648 |
103320220444232 has 16 divisors (see below), whose sum is σ = 211336814545200. Its totient is φ = 46963736565520.
The previous prime is 103320220444183. The next prime is 103320220444237. The reversal of 103320220444232 is 232444022023301.
It is a super-2 number, since 2×1033202204442322 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103320220444237) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 587046706982 + ... + 587046707157.
It is an arithmetic number, because the mean of its divisors is an integer number (13208550909075).
Almost surely, 2103320220444232 is an apocalyptic number.
It is an amenable number.
103320220444232 is an abundant number, since it is smaller than the sum of its proper divisors (108016594100968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103320220444232 is a wasteful number, since it uses less digits than its factorization.
103320220444232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1174093414156 (or 1174093414152 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 32.
Adding to 103320220444232 its reverse (232444022023301), we get a palindrome (335764242467533).
The spelling of 103320220444232 in words is "one hundred three trillion, three hundred twenty billion, two hundred twenty million, four hundred forty-four thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •