Base | Representation |
---|---|
bin | 1101100100100001011… |
… | …0100110111111010000 |
3 | 211021210002000211202011 |
4 | 3121020112212333100 |
5 | 12304433340323100 |
6 | 255034244432304 |
7 | 22562323216510 |
oct | 3311026467720 |
9 | 737702024664 |
10 | 233142120400 |
11 | 8a969715852 |
12 | 392269a8694 |
13 | 18ca6668cc7 |
14 | b3d9969840 |
15 | 60e7d66bba |
hex | 36485a6fd0 |
233142120400 has 60 divisors (see below), whose sum is σ = 640141658272. Its totient is φ = 79934440320.
The previous prime is 233142120331. The next prime is 233142120403. The reversal of 233142120400 is 4021241332.
233142120400 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 (233142120403) 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, 41629722 + ... + 41635321.
Almost surely, 2233142120400 is an apocalyptic number.
233142120400 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
233142120400 is an abundant number, since it is smaller than the sum of its proper divisors (406999537872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
233142120400 is a wasteful number, since it uses less digits than its factorization.
233142120400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83265068 (or 83265057 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 233142120400 its reverse (4021241332), we get a palindrome (237163361732).
The spelling of 233142120400 in words is "two hundred thirty-three billion, one hundred forty-two million, one hundred twenty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •