Base | Representation |
---|---|
bin | 110100111110101111110000… |
… | …110100101100110001010000 |
3 | 1010120000120100012210100210001 |
4 | 310332233300310230301100 |
5 | 221020120104121401000 |
6 | 2143323243103215344 |
7 | 100036303504244236 |
oct | 6476576064546120 |
9 | 1116016305710701 |
10 | 233010311122000 |
11 | 68276133075705 |
12 | 22172b618a7554 |
13 | a002a1650b739 |
14 | 4177a8b496956 |
15 | 1be11ed92446a |
hex | d3ebf0d2cc50 |
233010311122000 has 80 divisors (see below), whose sum is σ = 563620382696592. Its totient is φ = 93170799321600.
The previous prime is 233010311121983. The next prime is 233010311122021. The reversal of 233010311122000 is 221113010332.
It can be written as a sum of positive squares in 8 ways, for example, as 25659411822144 + 207350899299856 = 5065512^2 + 14399684^2 .
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15232807 + ... + 26420806.
Almost surely, 2233010311122000 is an apocalyptic number.
233010311122000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
233010311122000 is an abundant number, since it is smaller than the sum of its proper divisors (330610071574592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
233010311122000 is a wasteful number, since it uses less digits than its factorization.
233010311122000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41656433 (or 41656417 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 233010311122000 its reverse (221113010332), we get a palindrome (233231424132332).
The spelling of 233010311122000 in words is "two hundred thirty-three trillion, ten billion, three hundred eleven million, one hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •