Base | Representation |
---|---|
bin | 11011111110001100010000… |
… | …111111011000101110110111 |
3 | 121010120200210022221020001222 |
4 | 123332030100333120232313 |
5 | 112111034034011424114 |
6 | 1113351025453140555 |
7 | 34624655613505154 |
oct | 3376142077305667 |
9 | 533520708836058 |
10 | 123021033311159 |
11 | 3621aa22174975 |
12 | 1196a37318a75b |
13 | 5384aab735809 |
14 | 225436d58b22b |
15 | e350d56c698e |
hex | 6fe310fd8bb7 |
123021033311159 has 2 divisors, whose sum is σ = 123021033311160. Its totient is φ = 123021033311158.
The previous prime is 123021033311117. The next prime is 123021033311243. The reversal of 123021033311159 is 951113330120321.
It is a weak prime.
It is an emirp because it is prime and its reverse (951113330120321) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 123021033311159 - 212 = 123021033307063 is a prime.
It is a super-2 number, since 2×1230210333111592 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123021033311459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61510516655579 + 61510516655580.
It is an arithmetic number, because the mean of its divisors is an integer number (61510516655580).
Almost surely, 2123021033311159 is an apocalyptic number.
123021033311159 is a deficient number, since it is larger than the sum of its proper divisors (1).
123021033311159 is an equidigital number, since it uses as much as digits as its factorization.
123021033311159 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14580, while the sum is 35.
The spelling of 123021033311159 in words is "one hundred twenty-three trillion, twenty-one billion, thirty-three million, three hundred eleven thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.037 sec. • engine limits •