Base | Representation |
---|---|
bin | 11011111111101001101001… |
… | …010110011101000101001100 |
3 | 121010221021121002101211010220 |
4 | 123333221221112131011030 |
5 | 112114204410300013400 |
6 | 1113505051104231340 |
7 | 34635135406350312 |
oct | 3377515126350514 |
9 | 533837532354126 |
10 | 123121300001100 |
11 | 362594a50a3085 |
12 | 1198589630b550 |
13 | 539139a57c54b |
14 | 2259161bd00b2 |
15 | e37a030407a0 |
hex | 6ffa6959d14c |
123121300001100 has 144 divisors (see below), whose sum is σ = 366500555879808. Its totient is φ = 31899265896960.
The previous prime is 123121300001099. The next prime is 123121300001143. The reversal of 123121300001100 is 1100003121321.
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 123121300001100.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 40487754 + ... + 43422353.
Almost surely, 2123121300001100 is an apocalyptic number.
123121300001100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
123121300001100 is an abundant number, since it is smaller than the sum of its proper divisors (243379255878708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123121300001100 is a wasteful number, since it uses less digits than its factorization.
123121300001100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83910264 (or 83910257 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 123121300001100 its reverse (1100003121321), we get a palindrome (124221303122421).
The spelling of 123121300001100 in words is "one hundred twenty-three trillion, one hundred twenty-one billion, three hundred million, one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •