Base | Representation |
---|---|
bin | 10011100110011000000001… |
… | …11111010100001010011101 |
3 | 12122121022200001002002012212 |
4 | 21303030000333110022131 |
5 | 21122122311413204041 |
6 | 231355512310210205 |
7 | 12035605340222255 |
oct | 1163140077241235 |
9 | 178538601062185 |
10 | 43100013413021 |
11 | 12807681a58294 |
12 | 4a010a3353965 |
13 | 1b084106222a6 |
14 | a900a2124965 |
15 | 4eb1e49498eb |
hex | 273300fd429d |
43100013413021 has 2 divisors, whose sum is σ = 43100013413022. Its totient is φ = 43100013413020.
The previous prime is 43100013412991. The next prime is 43100013413029. The reversal of 43100013413021 is 12031431000134.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22664740562500 + 20435272850521 = 4760750^2 + 4520539^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-43100013413021 is a prime.
It is a super-2 number, since 2×431000134130212 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (43100013413029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21550006706510 + 21550006706511.
It is an arithmetic number, because the mean of its divisors is an integer number (21550006706511).
Almost surely, 243100013413021 is an apocalyptic number.
It is an amenable number.
43100013413021 is a deficient number, since it is larger than the sum of its proper divisors (1).
43100013413021 is an equidigital number, since it uses as much as digits as its factorization.
43100013413021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 43100013413021 its reverse (12031431000134), we get a palindrome (55131444413155).
The spelling of 43100013413021 in words is "forty-three trillion, one hundred billion, thirteen million, four hundred thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •