Base | Representation |
---|---|
bin | 10011000011111000… |
… | …00010101101101101 |
3 | 222102011022112020112 |
4 | 21201330002231231 |
5 | 131424131024201 |
6 | 4411230025405 |
7 | 511404416465 |
oct | 114174025555 |
9 | 28364275215 |
10 | 10233064301 |
11 | 4381330739 |
12 | 1b97048265 |
13 | c71080445 |
14 | 6d10b0ba5 |
15 | 3ed5990bb |
hex | 261f02b6d |
10233064301 has 8 divisors (see below), whose sum is σ = 10399046880. Its totient is φ = 10067471568.
The previous prime is 10233064271. The next prime is 10233064307. The reversal of 10233064301 is 10346033201.
10233064301 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 a cyclic number.
It is not a de Polignac number, because 10233064301 - 218 = 10232802157 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 (10233064307) 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, 44306 + ... + 149763.
It is an arithmetic number, because the mean of its divisors is an integer number (1299880860).
Almost surely, 210233064301 is an apocalyptic number.
It is an amenable number.
10233064301 is a deficient number, since it is larger than the sum of its proper divisors (165982579).
10233064301 is an equidigital number, since it uses as much as digits as its factorization.
10233064301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194923.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 10233064301 its reverse (10346033201), we get a palindrome (20579097502).
The spelling of 10233064301 in words is "ten billion, two hundred thirty-three million, sixty-four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •