Base | Representation |
---|---|
bin | 100110010101… |
… | …101110001101 |
3 | 200220121121201 |
4 | 212111232031 |
5 | 10033103240 |
6 | 555225501 |
7 | 151266406 |
oct | 46255615 |
9 | 20817551 |
10 | 10050445 |
11 | 5745059 |
12 | 3448291 |
13 | 210b812 |
14 | 14989ad |
15 | d37d9a |
hex | 995b8d |
10050445 has 4 divisors (see below), whose sum is σ = 12060540. Its totient is φ = 8040352.
The previous prime is 10050437. The next prime is 10050463. The reversal of 10050445 is 54405001.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 54405001 = 7 ⋅7772143.
It can be written as a sum of positive squares in 2 ways, for example, as 2316484 + 7733961 = 1522^2 + 2781^2 .
It is a cyclic number.
It is not a de Polignac number, because 10050445 - 23 = 10050437 is a prime.
It is a super-2 number, since 2×100504452 = 202022889396050, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1005040 + ... + 1005049.
It is an arithmetic number, because the mean of its divisors is an integer number (3015135).
Almost surely, 210050445 is an apocalyptic number.
It is an amenable number.
10050445 is a deficient number, since it is larger than the sum of its proper divisors (2010095).
10050445 is an equidigital number, since it uses as much as digits as its factorization.
10050445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2010094.
The product of its (nonzero) digits is 400, while the sum is 19.
The square root of 10050445 is about 3170.2436814857. The cubic root of 10050445 is about 215.8051297438.
Adding to 10050445 its reverse (54405001), we get a palindrome (64455446).
The spelling of 10050445 in words is "ten million, fifty thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •