Base | Representation |
---|---|
bin | 11011101110011001000111… |
… | …100111101010011100110011 |
3 | 120222201220101022122121200011 |
4 | 123232121013213222130303 |
5 | 111440242020204111032 |
6 | 1111200151503435351 |
7 | 34453351656213226 |
oct | 3356310747523463 |
9 | 528656338577604 |
10 | 121935323113267 |
11 | 35941531060794 |
12 | 11813a70bb5b57 |
13 | 53065b4306561 |
14 | 22179b5c775bd |
15 | e16c3e501247 |
hex | 6ee6479ea733 |
121935323113267 has 2 divisors, whose sum is σ = 121935323113268. Its totient is φ = 121935323113266.
The previous prime is 121935323113193. The next prime is 121935323113301. The reversal of 121935323113267 is 762311323539121.
It is a strong prime.
It is an emirp because it is prime and its reverse (762311323539121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121935323113267 - 215 = 121935323080499 is a prime.
It is a super-2 number, since 2×1219353231132672 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 121935323113267.
It is not a weakly prime, because it can be changed into another prime (121935323116267) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60967661556633 + 60967661556634.
It is an arithmetic number, because the mean of its divisors is an integer number (60967661556634).
Almost surely, 2121935323113267 is an apocalyptic number.
121935323113267 is a deficient number, since it is larger than the sum of its proper divisors (1).
121935323113267 is an equidigital number, since it uses as much as digits as its factorization.
121935323113267 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1224720, while the sum is 49.
The spelling of 121935323113267 in words is "one hundred twenty-one trillion, nine hundred thirty-five billion, three hundred twenty-three million, one hundred thirteen thousand, two hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •