Base | Representation |
---|---|
bin | 11011110000001000111111… |
… | …111011111110010100110001 |
3 | 121000011101110101210121102210 |
4 | 123300020333323332110301 |
5 | 111444224032021212423 |
6 | 1111331300130402333 |
7 | 34465133626042620 |
oct | 3360107773762461 |
9 | 530141411717383 |
10 | 122055453304113 |
11 | 3598847745814a |
12 | 118331b84303a9 |
13 | 5314a1a475214 |
14 | 221d7305cd6b7 |
15 | e19e20b21b93 |
hex | 6f023fefe531 |
122055453304113 has 8 divisors (see below), whose sum is σ = 185989262177728. Its totient is φ = 69745973316624.
The previous prime is 122055453304111. The next prime is 122055453304171. The reversal of 122055453304113 is 311403354550221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122055453304113 - 21 = 122055453304111 is a prime.
It is a super-3 number, since 3×1220554533041133 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (122055453304111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2906082221506 + ... + 2906082221547.
It is an arithmetic number, because the mean of its divisors is an integer number (23248657772216).
Almost surely, 2122055453304113 is an apocalyptic number.
It is an amenable number.
122055453304113 is a deficient number, since it is larger than the sum of its proper divisors (63933808873615).
122055453304113 is an equidigital number, since it uses as much as digits as its factorization.
122055453304113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5812164443063.
The product of its (nonzero) digits is 216000, while the sum is 39.
The spelling of 122055453304113 in words is "one hundred twenty-two trillion, fifty-five billion, four hundred fifty-three million, three hundred four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •