Base | Representation |
---|---|
bin | 1101100100011100011… |
… | …0111010011001110000 |
3 | 211021201121201102022101 |
4 | 3121013012322121300 |
5 | 12304413013302100 |
6 | 255032220550144 |
7 | 22561650514054 |
oct | 3310706723160 |
9 | 737647642271 |
10 | 233121228400 |
11 | 8a958946335 |
12 | 3921b9b2354 |
13 | 18ca2232888 |
14 | b3d6c8bc64 |
15 | 60e60db86a |
hex | 36471ba670 |
233121228400 has 60 divisors (see below), whose sum is σ = 560320844512. Its totient is φ = 93207352320.
The previous prime is 233121228367. The next prime is 233121228407. The reversal of 233121228400 is 4822121332.
233121228400 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (233121228407) 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 11 ways as a sum of consecutive naturals, for example, 787384 + ... + 1042216.
Almost surely, 2233121228400 is an apocalyptic number.
233121228400 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
233121228400 is an abundant number, since it is smaller than the sum of its proper divisors (327199616112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
233121228400 is a wasteful number, since it uses less digits than its factorization.
233121228400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257138 (or 257127 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 233121228400 its reverse (4822121332), we get a palindrome (237943349732).
The spelling of 233121228400 in words is "two hundred thirty-three billion, one hundred twenty-one million, two hundred twenty-eight thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •