Base | Representation |
---|---|
bin | 111101010000111000010… |
… | …101111111111011100101 |
3 | 112220110210001122201212121 |
4 | 331100320111333323211 |
5 | 1022434101342203221 |
6 | 12542015310345541 |
7 | 613110024050545 |
oct | 75207025777345 |
9 | 15813701581777 |
10 | 4210013241061 |
11 | 13835027a1001 |
12 | 57bb18abb2b1 |
13 | 24700578cc04 |
14 | 107aa122d325 |
15 | 747a3555a41 |
hex | 3d43857fee5 |
4210013241061 has 2 divisors, whose sum is σ = 4210013241062. Its totient is φ = 4210013241060.
The previous prime is 4210013241059. The next prime is 4210013241131. The reversal of 4210013241061 is 1601423100124.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4181333818561 + 28679422500 = 2044831^2 + 169350^2 .
It is a cyclic number.
It is not a de Polignac number, because 4210013241061 - 21 = 4210013241059 is a prime.
It is a super-2 number, since 2×42100132410612 (a number of 26 digits) contains 22 as substring.
Together with 4210013241059, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4210013241361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2105006620530 + 2105006620531.
It is an arithmetic number, because the mean of its divisors is an integer number (2105006620531).
Almost surely, 24210013241061 is an apocalyptic number.
It is an amenable number.
4210013241061 is a deficient number, since it is larger than the sum of its proper divisors (1).
4210013241061 is an equidigital number, since it uses as much as digits as its factorization.
4210013241061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 4210013241061 its reverse (1601423100124), we get a palindrome (5811436341185).
The spelling of 4210013241061 in words is "four trillion, two hundred ten billion, thirteen million, two hundred forty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •