Base | Representation |
---|---|
bin | 101110111101101100110101… |
… | …1010000110001010000011011 |
3 | 2000011200000012020202010012011 |
4 | 1131323121223100301100123 |
5 | 413121214001032201133 |
6 | 4022331402252130351 |
7 | 153004341424551166 |
oct | 13573315320612033 |
9 | 2004600166663164 |
10 | 413100344022043 |
11 | 10a698965773327 |
12 | 3a3b97454669b7 |
13 | 14967270087b32 |
14 | 7402240282add |
15 | 32b5a4bd076cd |
hex | 177b66b43141b |
413100344022043 has 2 divisors, whose sum is σ = 413100344022044. Its totient is φ = 413100344022042.
The previous prime is 413100344022029. The next prime is 413100344022059. The reversal of 413100344022043 is 340220443001314.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 413100344022043 - 25 = 413100344022011 is a prime.
It is a super-2 number, since 2×4131003440220432 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 413100344021996 and 413100344022014.
It is not a weakly prime, because it can be changed into another prime (413100344022643) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 206550172011021 + 206550172011022.
It is an arithmetic number, because the mean of its divisors is an integer number (206550172011022).
Almost surely, 2413100344022043 is an apocalyptic number.
413100344022043 is a deficient number, since it is larger than the sum of its proper divisors (1).
413100344022043 is an equidigital number, since it uses as much as digits as its factorization.
413100344022043 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 413100344022043 its reverse (340220443001314), we get a palindrome (753320787023357).
The spelling of 413100344022043 in words is "four hundred thirteen trillion, one hundred billion, three hundred forty-four million, twenty-two thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •