Base | Representation |
---|---|
bin | 10011001111101100… |
… | …11000000001011011 |
3 | 222200001221021111001 |
4 | 21213312120001123 |
5 | 132130023221021 |
6 | 4425131445431 |
7 | 514020415360 |
oct | 114766300133 |
9 | 28601837431 |
10 | 10332242011 |
11 | 4422310393 |
12 | 20042b6877 |
13 | c88796890 |
14 | 70032a467 |
15 | 40713a091 |
hex | 267d9805b |
10332242011 has 16 divisors (see below), whose sum is σ = 12721456384. Its totient is φ = 8171842464.
The previous prime is 10332241981. The next prime is 10332242021. The reversal of 10332242011 is 11024223301.
It is a happy number.
10332242011 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 a cyclic number.
It is not a de Polignac number, because 10332242011 - 25 = 10332241979 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10332242011.
It is not an unprimeable number, because it can be changed into a prime (10332242021) 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, 234820 + ... + 275326.
It is an arithmetic number, because the mean of its divisors is an integer number (795091024).
Almost surely, 210332242011 is an apocalyptic number.
10332242011 is a deficient number, since it is larger than the sum of its proper divisors (2389214373).
10332242011 is a wasteful number, since it uses less digits than its factorization.
10332242011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43330.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 10332242011 its reverse (11024223301), we get a palindrome (21356465312).
The spelling of 10332242011 in words is "ten billion, three hundred thirty-two million, two hundred forty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •