Base | Representation |
---|---|
bin | 10011001110101001… |
… | …10001011010001101 |
3 | 222122110100201221010 |
4 | 21213110301122031 |
5 | 132120244324401 |
6 | 4424214555433 |
7 | 513552506412 |
oct | 114724613215 |
9 | 28573321833 |
10 | 10323433101 |
11 | 44183440a3 |
12 | 2001368b79 |
13 | c86a011c7 |
14 | 6dd0b6109 |
15 | 406499ed6 |
hex | 26753168d |
10323433101 has 8 divisors (see below), whose sum is σ = 14208596224. Its totient is φ = 6660279360.
The previous prime is 10323433093. The next prime is 10323433103. The reversal of 10323433101 is 10133432301.
10323433101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10323433101 - 23 = 10323433093 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 (10323433103) 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 7 ways as a sum of consecutive naturals, for example, 55502236 + ... + 55502421.
It is an arithmetic number, because the mean of its divisors is an integer number (1776074528).
Almost surely, 210323433101 is an apocalyptic number.
It is an amenable number.
10323433101 is a deficient number, since it is larger than the sum of its proper divisors (3885163123).
10323433101 is a wasteful number, since it uses less digits than its factorization.
10323433101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111004691.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 10323433101 its reverse (10133432301), we get a palindrome (20456865402).
The spelling of 10323433101 in words is "ten billion, three hundred twenty-three million, four hundred thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •