Base | Representation |
---|---|
bin | 10011000011111001… |
… | …11110111111100001 |
3 | 222102011210001220222 |
4 | 21201330332333201 |
5 | 131424211424301 |
6 | 4411235212425 |
7 | 511406465351 |
oct | 114174767741 |
9 | 28364701828 |
10 | 10233311201 |
11 | 438148a193 |
12 | 1b97147115 |
13 | c71138939 |
14 | 6d1136b61 |
15 | 3ed5e731b |
hex | 261f3efe1 |
10233311201 has 4 divisors (see below), whose sum is σ = 10327194900. Its totient is φ = 10139427504.
The previous prime is 10233311191. The next prime is 10233311233. The reversal of 10233311201 is 10211333201.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5646771025 + 4586540176 = 75145^2 + 67724^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10233311201 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10233311201.
It is not an unprimeable number, because it can be changed into a prime (10233311701) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 46941686 + ... + 46941903.
It is an arithmetic number, because the mean of its divisors is an integer number (2581798725).
Almost surely, 210233311201 is an apocalyptic number.
It is an amenable number.
10233311201 is a deficient number, since it is larger than the sum of its proper divisors (93883699).
10233311201 is an equidigital number, since it uses as much as digits as its factorization.
10233311201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93883698.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 10233311201 its reverse (10211333201), we get a palindrome (20444644402).
The spelling of 10233311201 in words is "ten billion, two hundred thirty-three million, three hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •