Base | Representation |
---|---|
bin | 110100111110111000111110… |
… | …001111110110100101100010 |
3 | 1010120001111212101111110001110 |
4 | 310332320332033312211202 |
5 | 221020300332201122242 |
6 | 2143332000240444150 |
7 | 100040103532425501 |
oct | 6476707617664542 |
9 | 1116044771443043 |
10 | 233020200020322 |
11 | 6827a3480a6350 |
12 | 22174a61619656 |
13 | a003931199270 |
14 | 4178348978838 |
15 | 1be15cbb8839c |
hex | d3ee3e3f6962 |
233020200020322 has 64 divisors (see below), whose sum is σ = 549450680518656. Its totient is φ = 64950155760960.
The previous prime is 233020200020287. The next prime is 233020200020329. The reversal of 233020200020322 is 223020002020332.
It is not an unprimeable number, because it can be changed into a prime (233020200020329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 479589898 + ... + 480075525.
It is an arithmetic number, because the mean of its divisors is an integer number (8585166883104).
Almost surely, 2233020200020322 is an apocalyptic number.
233020200020322 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
233020200020322 is an abundant number, since it is smaller than the sum of its proper divisors (316430480498334).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
233020200020322 is a wasteful number, since it uses less digits than its factorization.
233020200020322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 959665735.
The product of its (nonzero) digits is 1728, while the sum is 21.
Adding to 233020200020322 its reverse (223020002020332), we get a palindrome (456040202040654).
The spelling of 233020200020322 in words is "two hundred thirty-three trillion, twenty billion, two hundred million, twenty thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •