Base | Representation |
---|---|
bin | 10011001110100111… |
… | …00000011011100011 |
3 | 222122102201212221022 |
4 | 21213103200123203 |
5 | 132120203221121 |
6 | 4424203520055 |
7 | 513546625400 |
oct | 114723403343 |
9 | 28572655838 |
10 | 10323101411 |
11 | 4418137977 |
12 | 200122902b |
13 | c8691623c |
14 | 6dd02b2a7 |
15 | 406431aab |
hex | 2674e06e3 |
10323101411 has 12 divisors (see below), whose sum is σ = 12010424400. Its totient is φ = 8846958960.
The previous prime is 10323101389. The next prime is 10323101419. The reversal of 10323101411 is 11410132301.
10323101411 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 10323101411 - 214 = 10323085027 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 10323101411.
It is not an unprimeable number, because it can be changed into a prime (10323101419) 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, 394565 + ... + 419913.
It is an arithmetic number, because the mean of its divisors is an integer number (1000868700).
Almost surely, 210323101411 is an apocalyptic number.
10323101411 is a deficient number, since it is larger than the sum of its proper divisors (1687322989).
10323101411 is an equidigital number, since it uses as much as digits as its factorization.
10323101411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33674 (or 33667 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 10323101411 its reverse (11410132301), we get a palindrome (21733233712).
The spelling of 10323101411 in words is "ten billion, three hundred twenty-three million, one hundred one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •