Base | Representation |
---|---|
bin | 11011100001011010011100… |
… | …110111111001000000111111 |
3 | 120212120122011200101201202101 |
4 | 123201122130313321000333 |
5 | 111331133340424424043 |
6 | 1105234323113005531 |
7 | 34332045203631622 |
oct | 3341323467710077 |
9 | 525518150351671 |
10 | 121043400233023 |
11 | 35628243922584 |
12 | 116ab0319b38a7 |
13 | 5270461052968 |
14 | 21c67634b1db9 |
15 | ded93b15524d |
hex | 6e169cdf903f |
121043400233023 has 16 divisors (see below), whose sum is σ = 123917656504320. Its totient is φ = 118196661492000.
The previous prime is 121043400233003. The next prime is 121043400233057. The reversal of 121043400233023 is 320332004340121.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 121043400233023 - 245 = 85859028144191 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121043400232982 and 121043400233000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121043400233003) 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, 150401313 + ... + 151203973.
It is an arithmetic number, because the mean of its divisors is an integer number (7744853531520).
Almost surely, 2121043400233023 is an apocalyptic number.
121043400233023 is a deficient number, since it is larger than the sum of its proper divisors (2874256271297).
121043400233023 is a wasteful number, since it uses less digits than its factorization.
121043400233023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 819798.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 121043400233023 its reverse (320332004340121), we get a palindrome (441375404573144).
The spelling of 121043400233023 in words is "one hundred twenty-one trillion, forty-three billion, four hundred million, two hundred thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •