Base | Representation |
---|---|
bin | 1101100100000100110… |
… | …1100100100000000001 |
3 | 211021110201120212022210 |
4 | 3121001031210200001 |
5 | 12304212202413101 |
6 | 255014324452333 |
7 | 22556336646306 |
oct | 3310115444001 |
9 | 737421525283 |
10 | 233022310401 |
11 | 8a908023821 |
12 | 391b284a0a9 |
13 | 18c878aa70a |
14 | b3c7a9d0ad |
15 | 60dc59c7d6 |
hex | 3641364801 |
233022310401 has 8 divisors (see below), whose sum is σ = 311120286400. Its totient is φ = 155136270672.
The previous prime is 233022310399. The next prime is 233022310403. The reversal of 233022310401 is 104013220332.
It is an interprime number because it is at equal distance from previous prime (233022310399) and next prime (233022310403).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 233022310401 - 21 = 233022310399 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (233022310403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 52981501 + ... + 52985898.
It is an arithmetic number, because the mean of its divisors is an integer number (38890035800).
Almost surely, 2233022310401 is an apocalyptic number.
It is an amenable number.
233022310401 is a deficient number, since it is larger than the sum of its proper divisors (78097975999).
233022310401 is a wasteful number, since it uses less digits than its factorization.
233022310401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105968135.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 233022310401 its reverse (104013220332), we get a palindrome (337035530733).
The spelling of 233022310401 in words is "two hundred thirty-three billion, twenty-two million, three hundred ten thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •