Base | Representation |
---|---|
bin | 110001000011100011… |
… | …1010011110001010101 |
3 | 101001220202012002101010 |
4 | 1202013013103301111 |
5 | 3211222042232003 |
6 | 120221215322433 |
7 | 10416400460265 |
oct | 1420707236125 |
9 | 331822162333 |
10 | 105346055253 |
11 | 4074a11358a |
12 | 18500220419 |
13 | 9c1b272b4a |
14 | 51550837a5 |
15 | 2b1874b003 |
hex | 18871d3c55 |
105346055253 has 4 divisors (see below), whose sum is σ = 140461407008. Its totient is φ = 70230703500.
The previous prime is 105346055249. The next prime is 105346055267. The reversal of 105346055253 is 352550643501.
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.
It is not a de Polignac number, because 105346055253 - 22 = 105346055249 is a prime.
It is a super-2 number, since 2×1053460552532 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105346055453) 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, 17557675873 + ... + 17557675878.
It is an arithmetic number, because the mean of its divisors is an integer number (35115351752).
Almost surely, 2105346055253 is an apocalyptic number.
It is an amenable number.
105346055253 is a deficient number, since it is larger than the sum of its proper divisors (35115351755).
105346055253 is an equidigital number, since it uses as much as digits as its factorization.
105346055253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35115351754.
The product of its (nonzero) digits is 270000, while the sum is 39.
Adding to 105346055253 its reverse (352550643501), we get a palindrome (457896698754).
The spelling of 105346055253 in words is "one hundred five billion, three hundred forty-six million, fifty-five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •