Base | Representation |
---|---|
bin | 1100100001001… |
… | …10001111101111 |
3 | 21022121021110212 |
4 | 12100212033233 |
5 | 203340424010 |
6 | 14230453035 |
7 | 2413415003 |
oct | 620461757 |
9 | 238537425 |
10 | 105014255 |
11 | 54306845 |
12 | 2b20417b |
13 | 189aac18 |
14 | dd38703 |
15 | 9345505 |
hex | 64263ef |
105014255 has 8 divisors (see below), whose sum is σ = 126393072. Its totient is φ = 83760768.
The previous prime is 105014233. The next prime is 105014257. The reversal of 105014255 is 552410501.
It is a happy number.
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 105014255 - 28 = 105013999 is a prime.
It is a super-2 number, since 2×1050142552 = 22055987506410050, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 105014255.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105014257) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29477 + ... + 32846.
It is an arithmetic number, because the mean of its divisors is an integer number (15799134).
Almost surely, 2105014255 is an apocalyptic number.
105014255 is a deficient number, since it is larger than the sum of its proper divisors (21378817).
105014255 is an equidigital number, since it uses as much as digits as its factorization.
105014255 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62665.
The product of its (nonzero) digits is 1000, while the sum is 23.
The square root of 105014255 is about 10247.6463151301. The cubic root of 105014255 is about 471.7907465029.
Adding to 105014255 its reverse (552410501), we get a palindrome (657424756).
The spelling of 105014255 in words is "one hundred five million, fourteen thousand, two hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •