Base | Representation |
---|---|
bin | 10111011011010101001010… |
… | …100011001110000011001000 |
3 | 111111210212202100011010221120 |
4 | 113123111022203032003020 |
5 | 102001044014112212222 |
6 | 1003044450340035240 |
7 | 30462622162055031 |
oct | 2733251243160310 |
9 | 444725670133846 |
10 | 103033221210312 |
11 | 2a914164336968 |
12 | b680641392b20 |
13 | 4564cb64c4a33 |
14 | 1b62b97c9da88 |
15 | bda1e582a15c |
hex | 5db54a8ce0c8 |
103033221210312 has 128 divisors (see below), whose sum is σ = 262629474681600. Its totient is φ = 33672482235392.
The previous prime is 103033221210287. The next prime is 103033221210329. The reversal of 103033221210312 is 213012122330301.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17816566573 + ... + 17816572355.
It is an arithmetic number, because the mean of its divisors is an integer number (2051792770950).
Almost surely, 2103033221210312 is an apocalyptic number.
103033221210312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103033221210312 is an abundant number, since it is smaller than the sum of its proper divisors (159596253471288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103033221210312 is a wasteful number, since it uses less digits than its factorization.
103033221210312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13367 (or 13363 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 103033221210312 its reverse (213012122330301), we get a palindrome (316045343540613).
The spelling of 103033221210312 in words is "one hundred three trillion, thirty-three billion, two hundred twenty-one million, two hundred ten thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •