Base | Representation |
---|---|
bin | 10011001110110000… |
… | …00111110100000111 |
3 | 222122112000100121010 |
4 | 21213120013310013 |
5 | 132121010430203 |
6 | 4424245453303 |
7 | 513563124645 |
oct | 114730076407 |
9 | 28575010533 |
10 | 10324311303 |
11 | 4418893989 |
12 | 2001711233 |
13 | c86c4ab57 |
14 | 6dd264195 |
15 | 4065c0303 |
hex | 267607d07 |
10324311303 has 16 divisors (see below), whose sum is σ = 13921456640. Its totient is φ = 6805161216.
The previous prime is 10324311299. The next prime is 10324311329. The reversal of 10324311303 is 30311342301.
10324311303 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10324311303 - 22 = 10324311299 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10324311303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10324311383) 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 15 ways as a sum of consecutive naturals, for example, 285276 + ... + 319422.
It is an arithmetic number, because the mean of its divisors is an integer number (870091040).
Almost surely, 210324311303 is an apocalyptic number.
10324311303 is a deficient number, since it is larger than the sum of its proper divisors (3597145337).
10324311303 is a wasteful number, since it uses less digits than its factorization.
10324311303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35286.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 10324311303 its reverse (30311342301), we get a palindrome (40635653604).
The spelling of 10324311303 in words is "ten billion, three hundred twenty-four million, three hundred eleven thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •