Base | Representation |
---|---|
bin | 11011110100000100000100… |
… | …110000101000101000000000 |
3 | 121001010011022121011020101222 |
4 | 123310010010300220220000 |
5 | 112013133142103244202 |
6 | 1112055203230214212 |
7 | 34523456416141115 |
oct | 3364040460505000 |
9 | 531104277136358 |
10 | 122325043415552 |
11 | 35a8183a00103a |
12 | 118774b5654368 |
13 | 5334282017513 |
14 | 222c7c6aaa90c |
15 | e21e4d6dd4a2 |
hex | 6f4104c28a00 |
122325043415552 has 80 divisors (see below), whose sum is σ = 245337036924672. Its totient is φ = 60931266048000.
The previous prime is 122325043415551. The next prime is 122325043415579. The reversal of 122325043415552 is 255514340523221.
It is not an unprimeable number, because it can be changed into a prime (122325043415551) 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, 143021177 + ... + 143873927.
Almost surely, 2122325043415552 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 122325043415552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (122668518462336).
122325043415552 is an abundant number, since it is smaller than the sum of its proper divisors (123011993509120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122325043415552 is an frugal number, since it uses more digits than its factorization.
122325043415552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 853829 (or 853813 counting only the distinct ones).
The product of its (nonzero) digits is 1440000, while the sum is 44.
Adding to 122325043415552 its reverse (255514340523221), we get a palindrome (377839383938773).
The spelling of 122325043415552 in words is "one hundred twenty-two trillion, three hundred twenty-five billion, forty-three million, four hundred fifteen thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.205 sec. • engine limits •