Base | Representation |
---|---|
bin | 11011100100010101101001… |
… | …111111110001001101111100 |
3 | 120220021212000101222011001011 |
4 | 123210111221333301031330 |
5 | 111342432022442420012 |
6 | 1105510525120325004 |
7 | 34352422336540642 |
oct | 3344255177611574 |
9 | 526255011864034 |
10 | 121244410123132 |
11 | 356a55137520aa |
12 | 11721b8b773764 |
13 | 52863b666283a |
14 | 21d2391757192 |
15 | e03ca30b11a7 |
hex | 6e4569ff137c |
121244410123132 has 48 divisors (see below), whose sum is σ = 224245788777472. Its totient is φ = 57269047731840.
The previous prime is 121244410123129. The next prime is 121244410123139. The reversal of 121244410123132 is 231321014442121.
It is a super-2 number, since 2×1212444101231322 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a junction number, because it is equal to n+sod(n) for n = 121244410123094 and 121244410123103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121244410123139) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2588368 + ... + 15785704.
Almost surely, 2121244410123132 is an apocalyptic number.
It is an amenable number.
121244410123132 is a deficient number, since it is larger than the sum of its proper divisors (103001378654340).
121244410123132 is a wasteful number, since it uses less digits than its factorization.
121244410123132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13199138 (or 13199136 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 31.
Adding to 121244410123132 its reverse (231321014442121), we get a palindrome (352565424565253).
The spelling of 121244410123132 in words is "one hundred twenty-one trillion, two hundred forty-four billion, four hundred ten million, one hundred twenty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •