Base | Representation |
---|---|
bin | 110100111110100110010000… |
… | …111101111111010101010000 |
3 | 1010112222121000111020121002012 |
4 | 310332212100331333111100 |
5 | 221014433212412310000 |
6 | 2143314435122242052 |
7 | 100035463002600260 |
oct | 6476462075772520 |
9 | 1115877014217065 |
10 | 233000113010000 |
11 | 6827187a548176 |
12 | 22170b964b6328 |
13 | a001a7c77843b |
14 | 41773a0cc37a0 |
15 | 1be0d03481735 |
hex | d3e990f7f550 |
233000113010000 has 200 divisors, whose sum is σ = 653536240509504. Its totient is φ = 78791425920000.
The previous prime is 233000113009949. The next prime is 233000113010003. The reversal of 233000113010000 is 10311000332.
It is a tau number, because it is divible by the number of its divisors (200).
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (233000113010003) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 17688446 + ... + 27908445.
Almost surely, 2233000113010000 is an apocalyptic number.
233000113010000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
233000113010000 is an abundant number, since it is smaller than the sum of its proper divisors (420536127499504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
233000113010000 is an equidigital number, since it uses as much as digits as its factorization.
233000113010000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45596999 (or 45596978 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 233000113010000 its reverse (10311000332), we get a palindrome (233010424010332).
The spelling of 233000113010000 in words is "two hundred thirty-three trillion, one hundred thirteen million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •