Base | Representation |
---|---|
bin | 10011100100000101… |
… | …00110110010111011 |
3 | 1000002222122212202101 |
4 | 21302002212302323 |
5 | 133002311023121 |
6 | 4454120244231 |
7 | 521164620565 |
oct | 116202466273 |
9 | 30088585671 |
10 | 10503220411 |
11 | 44aa880a52 |
12 | 2051610677 |
13 | cb502c328 |
14 | 718d16335 |
15 | 417160491 |
hex | 2720a6cbb |
10503220411 has 12 divisors (see below), whose sum is σ = 11041175880. Its totient is φ = 9990342560.
The previous prime is 10503220393. The next prime is 10503220417. The reversal of 10503220411 is 11402230501.
10503220411 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10503220411 - 219 = 10502696123 is a prime.
It is a super-2 number, since 2×105032204112 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10503220417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 39231 + ... + 150151.
It is an arithmetic number, because the mean of its divisors is an integer number (920097990).
Almost surely, 210503220411 is an apocalyptic number.
10503220411 is a deficient number, since it is larger than the sum of its proper divisors (537955469).
10503220411 is a wasteful number, since it uses less digits than its factorization.
10503220411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111146 (or 111123 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 19.
Adding to 10503220411 its reverse (11402230501), we get a palindrome (21905450912).
The spelling of 10503220411 in words is "ten billion, five hundred three million, two hundred twenty thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •