Base | Representation |
---|---|
bin | 1100100010001… |
… | …10011011011001 |
3 | 21022211222022000 |
4 | 12101012123121 |
5 | 203404133243 |
6 | 14233351213 |
7 | 2414504214 |
oct | 621063331 |
9 | 238758260 |
10 | 105146073 |
11 | 5439688a |
12 | 2b268509 |
13 | 18a25c16 |
14 | dd7077b |
15 | 936e5d3 |
hex | 64466d9 |
105146073 has 16 divisors (see below), whose sum is σ = 156595200. Its totient is φ = 69726960.
The previous prime is 105146059. The next prime is 105146081. The reversal of 105146073 is 370641501.
105146073 is a `hidden beast` number, since 1 + 0 + 51 + 4 + 607 + 3 = 666.
It is not a de Polignac number, because 105146073 - 26 = 105146009 is a prime.
It is a super-2 number, since 2×1051460732 = 22111393334642658, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (105146023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5038 + ... + 15351.
It is an arithmetic number, because the mean of its divisors is an integer number (9787200).
Almost surely, 2105146073 is an apocalyptic number.
It is an amenable number.
105146073 is a deficient number, since it is larger than the sum of its proper divisors (51449127).
105146073 is a wasteful number, since it uses less digits than its factorization.
105146073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20589 (or 20583 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 105146073 is about 10254.0759213105. The cubic root of 105146073 is about 471.9880673633.
Adding to 105146073 its reverse (370641501), we get a palindrome (475787574).
The spelling of 105146073 in words is "one hundred five million, one hundred forty-six thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •