Base | Representation |
---|---|
bin | 100111001001… |
… | …101100101101 |
3 | 201022102122202 |
4 | 213021230231 |
5 | 10111411331 |
6 | 1003551245 |
7 | 153144164 |
oct | 47115455 |
9 | 21272582 |
10 | 10263341 |
11 | 5880000 |
12 | 352b525 |
13 | 21846aa |
14 | 15123db |
15 | d7aecb |
hex | 9c9b2d |
10263341 has 10 divisors (see below), whose sum is σ = 11305710. Its totient is φ = 9317000.
The previous prime is 10263329. The next prime is 10263349. The reversal of 10263341 is 14336201.
It can be written as a sum of positive squares in only one way, i.e., 9897316 + 366025 = 3146^2 + 605^2 .
It is a de Polignac number, because none of the positive numbers 2k-10263341 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10263349) 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 9 ways as a sum of consecutive naturals, for example, 14291 + ... + 14991.
It is an arithmetic number, because the mean of its divisors is an integer number (1130571).
Almost surely, 210263341 is an apocalyptic number.
10263341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10263341 is a deficient number, since it is larger than the sum of its proper divisors (1042369).
10263341 is an frugal number, since it uses more digits than its factorization.
10263341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 745 (or 712 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
The square root of 10263341 is about 3203.6449553594. The cubic root of 10263341 is about 217.3182768895.
Adding to 10263341 its reverse (14336201), we get a palindrome (24599542).
The spelling of 10263341 in words is "ten million, two hundred sixty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •