Base | Representation |
---|---|
bin | 10111011101111011110111… |
… | …001011110110110011101000 |
3 | 111112102222202110101220001021 |
4 | 113131323313023312303220 |
5 | 102012012102032001204 |
6 | 1003303011340502224 |
7 | 30511556544645220 |
oct | 2735736713666350 |
9 | 445388673356037 |
10 | 103212211203304 |
11 | 2a98306453a905 |
12 | b6ab27484a974 |
13 | 4578b3cb072a8 |
14 | 1b6b6d78a5080 |
15 | bdebbe527154 |
hex | 5ddef72f6ce8 |
103212211203304 has 32 divisors (see below), whose sum is σ = 221231696299200. Its totient is φ = 44221270343040.
The previous prime is 103212211203229. The next prime is 103212211203313. The reversal of 103212211203304 is 403302112212301.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 260935162 + ... + 261330409.
It is an arithmetic number, because the mean of its divisors is an integer number (6913490509350).
Almost surely, 2103212211203304 is an apocalyptic number.
103212211203304 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
103212211203304 is an abundant number, since it is smaller than the sum of its proper divisors (118019485095896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103212211203304 is a wasteful number, since it uses less digits than its factorization.
103212211203304 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 522269113 (or 522269109 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 103212211203304 its reverse (403302112212301), we get a palindrome (506514323415605).
The spelling of 103212211203304 in words is "one hundred three trillion, two hundred twelve billion, two hundred eleven million, two hundred three thousand, three hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •