Base | Representation |
---|---|
bin | 101110111101110010010100… |
… | …0000010100011000011000010 |
3 | 2000011201010112121210200122200 |
4 | 1131323210220002203003002 |
5 | 413121412040341402432 |
6 | 4022341025043414030 |
7 | 153005235656344224 |
oct | 13573445002430302 |
9 | 2004633477720580 |
10 | 413112101122242 |
11 | 10a6a2949300765 |
12 | 3a3bba86984316 |
13 | 149683c4ac4962 |
14 | 7402a37912414 |
15 | 32b5ed9097a7c |
hex | 177b9280a30c2 |
413112101122242 has 24 divisors (see below), whose sum is σ = 896125546469244. Its totient is φ = 137542598727264.
The previous prime is 413112101122229. The next prime is 413112101122247. The reversal of 413112101122242 is 242221101211314.
413112101122242 is a `hidden beast` number, since 4 + 1 + 311 + 2 + 10 + 112 + 224 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 412938204616161 + 173896506081 = 20320881^2 + 417009^2 .
It is not an unprimeable number, because it can be changed into a prime (413112101122247) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13452899233 + ... + 13452929940.
Almost surely, 2413112101122242 is an apocalyptic number.
413112101122242 is an abundant number, since it is smaller than the sum of its proper divisors (483013445347002).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
413112101122242 is a wasteful number, since it uses less digits than its factorization.
413112101122242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26905830034 (or 26905830031 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
Adding to 413112101122242 its reverse (242221101211314), we get a palindrome (655333202333556).
The spelling of 413112101122242 in words is "four hundred thirteen trillion, one hundred twelve billion, one hundred one million, one hundred twenty-two thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •