Base | Representation |
---|---|
bin | 10011000001010111… |
… | …01100000100101001 |
3 | 222100200200100111202 |
4 | 21200223230010221 |
5 | 131403233000131 |
6 | 4405154333545 |
7 | 511030365605 |
oct | 114053540451 |
9 | 28320610452 |
10 | 10212000041 |
11 | 4370453861 |
12 | 1b8bb8a2b5 |
13 | c698b6799 |
14 | 6cc38a505 |
15 | 3eb7d7bcb |
hex | 260aec129 |
10212000041 has 4 divisors (see below), whose sum is σ = 10274650512. Its totient is φ = 10149349572.
The previous prime is 10212000031. The next prime is 10212000049. The reversal of 10212000041 is 14000021201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 14000021201 = 89 ⋅157303609.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10212000041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10211999986 and 10212000031.
It is not an unprimeable number, because it can be changed into a prime (10212000049) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 31324991 + ... + 31325316.
It is an arithmetic number, because the mean of its divisors is an integer number (2568662628).
Almost surely, 210212000041 is an apocalyptic number.
It is an amenable number.
10212000041 is a deficient number, since it is larger than the sum of its proper divisors (62650471).
10212000041 is an equidigital number, since it uses as much as digits as its factorization.
10212000041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62650470.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 10212000041 its reverse (14000021201), we get a palindrome (24212021242).
The spelling of 10212000041 in words is "ten billion, two hundred twelve million, forty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •