Base | Representation |
---|---|
bin | 110001011000010001… |
… | …0110001010111111101 |
3 | 101010201012002001022021 |
4 | 1202300202301113331 |
5 | 3214133011322003 |
6 | 120414205120141 |
7 | 10442540435665 |
oct | 1426042612775 |
9 | 333635061267 |
10 | 106041120253 |
11 | 40a764a2172 |
12 | 18674b59051 |
13 | 9ccc274c03 |
14 | 51bd4d51a5 |
15 | 2b597962bd |
hex | 18b08b15fd |
106041120253 has 2 divisors, whose sum is σ = 106041120254. Its totient is φ = 106041120252.
The previous prime is 106041120203. The next prime is 106041120287. The reversal of 106041120253 is 352021140601.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 57340133764 + 48700986489 = 239458^2 + 220683^2 .
It is a cyclic number.
It is not a de Polignac number, because 106041120253 - 229 = 105504249341 is a prime.
It is a super-2 number, since 2×1060411202532 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106041120203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53020560126 + 53020560127.
It is an arithmetic number, because the mean of its divisors is an integer number (53020560127).
Almost surely, 2106041120253 is an apocalyptic number.
It is an amenable number.
106041120253 is a deficient number, since it is larger than the sum of its proper divisors (1).
106041120253 is an equidigital number, since it uses as much as digits as its factorization.
106041120253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 106041120253 its reverse (352021140601), we get a palindrome (458062260854).
The spelling of 106041120253 in words is "one hundred six billion, forty-one million, one hundred twenty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •