Base | Representation |
---|---|
bin | 11011110100000100011010… |
… | …000001010010110101111000 |
3 | 121001010012020110022220101210 |
4 | 123310010122001102311320 |
5 | 112013134404411314222 |
6 | 1112055302451243120 |
7 | 34523501310014046 |
oct | 3364043201226570 |
9 | 531105213286353 |
10 | 122325400104312 |
11 | 35a81a02384639 |
12 | 11877594ba94a0 |
13 | 533430aba3062 |
14 | 222c81c1d9396 |
15 | e21e6eb98d0c |
hex | 6f411a052d78 |
122325400104312 has 16 divisors (see below), whose sum is σ = 305813500260840. Its totient is φ = 40775133368096.
The previous prime is 122325400104247. The next prime is 122325400104371. The reversal of 122325400104312 is 213401004523221.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 122325400104312.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2548445835483 + ... + 2548445835530.
Almost surely, 2122325400104312 is an apocalyptic number.
122325400104312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
122325400104312 is an abundant number, since it is smaller than the sum of its proper divisors (183488100156528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122325400104312 is a wasteful number, since it uses less digits than its factorization.
122325400104312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5096891671022 (or 5096891671018 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 30.
Adding to 122325400104312 its reverse (213401004523221), we get a palindrome (335726404627533).
The spelling of 122325400104312 in words is "one hundred twenty-two trillion, three hundred twenty-five billion, four hundred million, one hundred four thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •