Base | Representation |
---|---|
bin | 11011110111011001100110… |
… | …011010011110010100110011 |
3 | 121001221002002221011111221002 |
4 | 123313121212122132110303 |
5 | 112030412214122240201 |
6 | 1112352401452552215 |
7 | 34546154113611206 |
oct | 3367314632362463 |
9 | 531832087144832 |
10 | 122554315040051 |
11 | 3605aaa1945a44 |
12 | 118b3a2018266b |
13 | 534ca8c83595b |
14 | 223993659393d |
15 | e27dbb86176b |
hex | 6f766669e533 |
122554315040051 has 4 divisors (see below), whose sum is σ = 122554436349672. Its totient is φ = 122554193730432.
The previous prime is 122554315039999. The next prime is 122554315040057. The reversal of 122554315040051 is 150040513455221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 122554315040051 - 214 = 122554315023667 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122554315039987 and 122554315040014.
It is not an unprimeable number, because it can be changed into a prime (122554315040057) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 59126585 + ... + 61164218.
It is an arithmetic number, because the mean of its divisors is an integer number (30638609087418).
Almost surely, 2122554315040051 is an apocalyptic number.
122554315040051 is a deficient number, since it is larger than the sum of its proper divisors (121309621).
122554315040051 is a wasteful number, since it uses less digits than its factorization.
122554315040051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 121309620.
The product of its (nonzero) digits is 120000, while the sum is 38.
Adding to 122554315040051 its reverse (150040513455221), we get a palindrome (272594828495272).
The spelling of 122554315040051 in words is "one hundred twenty-two trillion, five hundred fifty-four billion, three hundred fifteen million, forty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •