Base | Representation |
---|---|
bin | 10111011011010011000111… |
… | …011010000101111001001000 |
3 | 111111210200002000001222222101 |
4 | 113123103013122011321020 |
5 | 102001030012334033222 |
6 | 1003043444142003144 |
7 | 30462513514441324 |
oct | 2733230732057110 |
9 | 444720060058871 |
10 | 103031021002312 |
11 | 2a913235385047 |
12 | b6801285764b4 |
13 | 4564a2571c800 |
14 | 1b62a299aa984 |
15 | bda1175bb927 |
hex | 5db4c7685e48 |
103031021002312 has 48 divisors (see below), whose sum is σ = 210518901985140. Its totient is φ = 47249894884608.
The previous prime is 103031021002307. The next prime is 103031021002321. The reversal of 103031021002312 is 213200120130301.
It can be written as a sum of positive squares in 6 ways, for example, as 3341459697156 + 99689561305156 = 1827966^2 + 9984466^2 .
It is a super-2 number, since 2×1030310210023122 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 103031021002312.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 242483203 + ... + 242907730.
Almost surely, 2103031021002312 is an apocalyptic number.
It is an amenable number.
103031021002312 is an abundant number, since it is smaller than the sum of its proper divisors (107487880982828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103031021002312 is a wasteful number, since it uses less digits than its factorization.
103031021002312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 485391122 (or 485391105 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 103031021002312 its reverse (213200120130301), we get a palindrome (316231141132613).
The spelling of 103031021002312 in words is "one hundred three trillion, thirty-one billion, twenty-one million, two thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •