Base | Representation |
---|---|
bin | 1101100100000000000… |
… | …1010100100100110111 |
3 | 211021102022222100201012 |
4 | 3121000001110210313 |
5 | 12304142043302411 |
6 | 255012332222435 |
7 | 22556005026620 |
oct | 3310001244467 |
9 | 737368870635 |
10 | 233002322231 |
11 | 8a8a7811378 |
12 | 391a800aa1b |
13 | 18c836cc7b3 |
14 | b3c5178a47 |
15 | 60da95018b |
hex | 3640054937 |
233002322231 has 8 divisors (see below), whose sum is σ = 266364240384. Its totient is φ = 199659372120.
The previous prime is 233002322221. The next prime is 233002322263. The reversal of 233002322231 is 132223200332.
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 233002322231 - 210 = 233002321207 is a prime.
It is a super-2 number, since 2×2330023222312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 233002322197 and 233002322206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (233002322221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4715675 + ... + 4764828.
It is an arithmetic number, because the mean of its divisors is an integer number (33295530048).
Almost surely, 2233002322231 is an apocalyptic number.
233002322231 is a deficient number, since it is larger than the sum of its proper divisors (33361918153).
233002322231 is an equidigital number, since it uses as much as digits as its factorization.
233002322231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9484021.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 233002322231 its reverse (132223200332), we get a palindrome (365225522563).
The spelling of 233002322231 in words is "two hundred thirty-three billion, two million, three hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •