Base | Representation |
---|---|
bin | 10011000000010101… |
… | …00101111110010111 |
3 | 222100002100120122102 |
4 | 21200022211332113 |
5 | 131344022334221 |
6 | 4404244352315 |
7 | 510563553125 |
oct | 114012457627 |
9 | 28302316572 |
10 | 10203324311 |
11 | 4366568634 |
12 | 1b890a569b |
13 | c67b6990b |
14 | 6cb16c915 |
15 | 3eab7230b |
hex | 2602a5f97 |
10203324311 has 4 divisors (see below), whose sum is σ = 10740341400. Its totient is φ = 9666307224.
The previous prime is 10203324281. The next prime is 10203324319. The reversal of 10203324311 is 11342330201.
10203324311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10203324311 - 210 = 10203323287 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 (10203324319) 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 3 ways as a sum of consecutive naturals, for example, 268508516 + ... + 268508553.
It is an arithmetic number, because the mean of its divisors is an integer number (2685085350).
Almost surely, 210203324311 is an apocalyptic number.
10203324311 is a deficient number, since it is larger than the sum of its proper divisors (537017089).
10203324311 is an equidigital number, since it uses as much as digits as its factorization.
10203324311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 537017088.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 10203324311 its reverse (11342330201), we get a palindrome (21545654512).
The spelling of 10203324311 in words is "ten billion, two hundred three million, three hundred twenty-four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •