Base | Representation |
---|---|
bin | 11011111101111000110011… |
… | …001011010000010001011100 |
3 | 121010111200211200110011120120 |
4 | 123331320303023100101130 |
5 | 112110213232243323400 |
6 | 1113333251445514540 |
7 | 34623315635416251 |
oct | 3375706313202134 |
9 | 533450750404516 |
10 | 123000132011100 |
11 | 36212076a05873 |
12 | 119662bb412a50 |
13 | 5382b2a3ca846 |
14 | 22533496cb428 |
15 | e347b0773ca0 |
hex | 6fde332d045c |
123000132011100 has 36 divisors (see below), whose sum is σ = 355880381952984. Its totient is φ = 32800035202880.
The previous prime is 123000132011083. The next prime is 123000132011189. The reversal of 123000132011100 is 1110231000321.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 123000132011100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 205000219719 + ... + 205000220318.
Almost surely, 2123000132011100 is an apocalyptic number.
123000132011100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
123000132011100 is an abundant number, since it is smaller than the sum of its proper divisors (232880249941884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123000132011100 is a wasteful number, since it uses less digits than its factorization.
123000132011100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 410000440054 (or 410000440047 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 123000132011100 its reverse (1110231000321), we get a palindrome (124110363011421).
The spelling of 123000132011100 in words is "one hundred twenty-three trillion, one hundred thirty-two million, eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •