Base | Representation |
---|---|
bin | 110001000101001110… |
… | …1101100001110101011 |
3 | 101002001122221021220111 |
4 | 1202022131230032223 |
5 | 3211330434114001 |
6 | 120230544035151 |
7 | 10420652243620 |
oct | 1421235541653 |
9 | 332048837814 |
10 | 105402254251 |
11 | 40778908738 |
12 | 18517002ab7 |
13 | 9c29abb9a8 |
14 | 515c712347 |
15 | 2b1d64c851 |
hex | 188a76c3ab |
105402254251 has 8 divisors (see below), whose sum is σ = 127545585120. Its totient is φ = 85030389888.
The previous prime is 105402254219. The next prime is 105402254257. The reversal of 105402254251 is 152452204501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105402254251 - 25 = 105402254219 is a prime.
It is a super-2 number, since 2×1054022542512 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105402254257) 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 in 7 ways as a sum of consecutive naturals, for example, 442866496 + ... + 442866733.
It is an arithmetic number, because the mean of its divisors is an integer number (15943198140).
Almost surely, 2105402254251 is an apocalyptic number.
105402254251 is a deficient number, since it is larger than the sum of its proper divisors (22143330869).
105402254251 is an equidigital number, since it uses as much as digits as its factorization.
105402254251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 885733253.
The product of its (nonzero) digits is 16000, while the sum is 31.
Adding to 105402254251 its reverse (152452204501), we get a palindrome (257854458752).
The spelling of 105402254251 in words is "one hundred five billion, four hundred two million, two hundred fifty-four thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •