Base | Representation |
---|---|
bin | 1001001100000100111111… |
… | …0011110001011011001001 |
3 | 1022202211212112221011111102 |
4 | 2103001033303301123021 |
5 | 2311012123111131131 |
6 | 33253145003511145 |
7 | 2061632200335305 |
oct | 223011763613311 |
9 | 38684775834442 |
10 | 10103102052041 |
11 | 32457797a2799 |
12 | 11720705284b5 |
13 | 583945530ccb |
14 | 26cdc815cd05 |
15 | 127c1167e1cb |
hex | 9304fcf16c9 |
10103102052041 has 2 divisors, whose sum is σ = 10103102052042. Its totient is φ = 10103102052040.
The previous prime is 10103102051981. The next prime is 10103102052059. The reversal of 10103102052041 is 14025020130101.
10103102052041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7132291303225 + 2970810748816 = 2670635^2 + 1723604^2 .
It is a cyclic number.
It is not a de Polignac number, because 10103102052041 - 210 = 10103102051017 is a prime.
It is not a weakly prime, because it can be changed into another prime (10103102054041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5051551026020 + 5051551026021.
It is an arithmetic number, because the mean of its divisors is an integer number (5051551026021).
Almost surely, 210103102052041 is an apocalyptic number.
It is an amenable number.
10103102052041 is a deficient number, since it is larger than the sum of its proper divisors (1).
10103102052041 is an equidigital number, since it uses as much as digits as its factorization.
10103102052041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 10103102052041 its reverse (14025020130101), we get a palindrome (24128122182142).
The spelling of 10103102052041 in words is "ten trillion, one hundred three billion, one hundred two million, fifty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •