Base | Representation |
---|---|
bin | 101111000011000100100… |
… | …011101111111000110000 |
3 | 102110002020012201100022020 |
4 | 233003010203233320300 |
5 | 410432403424041422 |
6 | 10513134402311440 |
7 | 452404362005412 |
oct | 57030443577060 |
9 | 12402205640266 |
10 | 3233113112112 |
11 | 1037179079134 |
12 | 442723058580 |
13 | 1a5b5c180430 |
14 | b26aaa709b2 |
15 | 59179c7a95c |
hex | 2f0c48efe30 |
3233113112112 has 80 divisors (see below), whose sum is σ = 9083742957408. Its totient is φ = 984954470400.
The previous prime is 3233113112083. The next prime is 3233113112143. The reversal of 3233113112112 is 2112113113323.
3233113112112 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×32331131121122 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a nude number because it is divisible by every one of its digits.
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, 25586833 + ... + 25712880.
Almost surely, 23233113112112 is an apocalyptic number.
It is an amenable number.
3233113112112 is an abundant number, since it is smaller than the sum of its proper divisors (5850629845296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3233113112112 is a wasteful number, since it uses less digits than its factorization.
3233113112112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51299838 (or 51299832 counting only the distinct ones).
The product of its digits is 648, while the sum is 24.
Adding to 3233113112112 its reverse (2112113113323), we get a palindrome (5345226225435).
The spelling of 3233113112112 in words is "three trillion, two hundred thirty-three billion, one hundred thirteen million, one hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •