Base | Representation |
---|---|
bin | 10011001110011010… |
… | …01001001011010101 |
3 | 222122022121010201110 |
4 | 21213031021023111 |
5 | 132114241331201 |
6 | 4424104045233 |
7 | 513526510164 |
oct | 114715111325 |
9 | 28568533643 |
10 | 10321433301 |
11 | 44171a8673 |
12 | 2000763819 |
13 | c86480baa |
14 | 6dcb153db |
15 | 4062026d6 |
hex | 2673492d5 |
10321433301 has 16 divisors (see below), whose sum is σ = 13890614400. Its totient is φ = 6816902400.
The previous prime is 10321433299. The next prime is 10321433303. The reversal of 10321433301 is 10333412301.
10321433301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (10321433299) and next prime (10321433303).
It is not a de Polignac number, because 10321433301 - 21 = 10321433299 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10321433303) 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, 102001 + ... + 176201.
It is an arithmetic number, because the mean of its divisors is an integer number (868163400).
Almost surely, 210321433301 is an apocalyptic number.
It is an amenable number.
10321433301 is a deficient number, since it is larger than the sum of its proper divisors (3569181099).
10321433301 is a wasteful number, since it uses less digits than its factorization.
10321433301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74636.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 10321433301 its reverse (10333412301), we get a palindrome (20654845602).
The spelling of 10321433301 in words is "ten billion, three hundred twenty-one million, four hundred thirty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •