Base | Representation |
---|---|
bin | 111101101111111001110… |
… | …100110101111000000101 |
3 | 120000122202112220201000121 |
4 | 331233321310311320011 |
5 | 1024010311432200401 |
6 | 13005204533541541 |
7 | 615366345506632 |
oct | 75577164657005 |
9 | 16018675821017 |
10 | 4243324100101 |
11 | 1396646916479 |
12 | 5864747a48b1 |
13 | 24a1b3a69ba8 |
14 | 10954127d189 |
15 | 755a2b79ca1 |
hex | 3dbf9d35e05 |
4243324100101 has 2 divisors, whose sum is σ = 4243324100102. Its totient is φ = 4243324100100.
The previous prime is 4243324100027. The next prime is 4243324100107. The reversal of 4243324100101 is 1010014233424.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3874086792900 + 369237307201 = 1968270^2 + 607649^2 .
It is a cyclic number.
It is not a de Polignac number, because 4243324100101 - 211 = 4243324098053 is a prime.
It is a super-2 number, since 2×42433241001012 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4243324100107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2121662050050 + 2121662050051.
It is an arithmetic number, because the mean of its divisors is an integer number (2121662050051).
Almost surely, 24243324100101 is an apocalyptic number.
It is an amenable number.
4243324100101 is a deficient number, since it is larger than the sum of its proper divisors (1).
4243324100101 is an equidigital number, since it uses as much as digits as its factorization.
4243324100101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 4243324100101 its reverse (1010014233424), we get a palindrome (5253338333525).
The spelling of 4243324100101 in words is "four trillion, two hundred forty-three billion, three hundred twenty-four million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •