Base | Representation |
---|---|
bin | 1101100100000100110… |
… | …1111100110100100110 |
3 | 211021110201202220222110 |
4 | 3121001031330310212 |
5 | 12304212214110042 |
6 | 255014330541450 |
7 | 22556340542613 |
oct | 3310115746446 |
9 | 737421686873 |
10 | 233022410022 |
11 | 8a908091656 |
12 | 391b2897886 |
13 | 18c87913b6c |
14 | b3c7ac750a |
15 | 60dc5bc09c |
hex | 364137cd26 |
233022410022 has 32 divisors (see below), whose sum is σ = 483006682080. Its totient is φ = 74857063680.
The previous prime is 233022410017. The next prime is 233022410029. The reversal of 233022410022 is 220014220332.
233022410022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2330224100222 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (233022410029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1143583 + ... + 1331850.
It is an arithmetic number, because the mean of its divisors is an integer number (15093958815).
Almost surely, 2233022410022 is an apocalyptic number.
233022410022 is an abundant number, since it is smaller than the sum of its proper divisors (249984272058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
233022410022 is a wasteful number, since it uses less digits than its factorization.
233022410022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2476008.
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 233022410022 its reverse (220014220332), we get a palindrome (453036630354).
The spelling of 233022410022 in words is "two hundred thirty-three billion, twenty-two million, four hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •