Base | Representation |
---|---|
bin | 10111101101111011010011… |
… | …100000010110000011111010 |
3 | 111200100001020121010022000200 |
4 | 113231323103200112003322 |
5 | 102133013140300102302 |
6 | 1005503511404343030 |
7 | 30654141620331522 |
oct | 2755732340260372 |
9 | 450301217108020 |
10 | 104311124222202 |
11 | 30267110268907 |
12 | b848240544a76 |
13 | 462865c63c581 |
14 | 1ba898485c682 |
15 | c0d58986481c |
hex | 5eded38160fa |
104311124222202 has 12 divisors (see below), whose sum is σ = 226007435814810. Its totient is φ = 34770374740728.
The previous prime is 104311124222147. The next prime is 104311124222209. The reversal of 104311124222202 is 202222421113401.
104311124222202 is a `hidden beast` number, since 1 + 0 + 4 + 3 + 1 + 1 + 12 + 422 + 220 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 89709103877121 + 14602020345081 = 9471489^2 + 3821259^2 .
It is not an unprimeable number, because it can be changed into a prime (104311124222209) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2897531228377 + ... + 2897531228412.
Almost surely, 2104311124222202 is an apocalyptic number.
104311124222202 is an abundant number, since it is smaller than the sum of its proper divisors (121696311592608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104311124222202 is a wasteful number, since it uses less digits than its factorization.
104311124222202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5795062456797 (or 5795062456794 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 104311124222202 its reverse (202222421113401), we get a palindrome (306533545335603).
The spelling of 104311124222202 in words is "one hundred four trillion, three hundred eleven billion, one hundred twenty-four million, two hundred twenty-two thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •