Base | Representation |
---|---|
bin | 11011110100001000110010… |
… | …111011101101111010100000 |
3 | 121001010122101220112211210121 |
4 | 123310020302323231322200 |
5 | 112013224032414240112 |
6 | 1112101402250010024 |
7 | 34524026145216322 |
oct | 3364106273557240 |
9 | 531118356484717 |
10 | 122330113040032 |
11 | 35a83a00742a37 |
12 | 1187848b416914 |
13 | 53348ac412a11 |
14 | 222cb480d3612 |
15 | e221487e9407 |
hex | 6f4232eedea0 |
122330113040032 has 24 divisors (see below), whose sum is σ = 244229486249952. Its totient is φ = 60303576849600.
The previous prime is 122330113040021. The next prime is 122330113040039. The reversal of 122330113040032 is 230040311033221.
It is a super-2 number, since 2×1223301130400322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122330113039979 and 122330113040006.
It is not an unprimeable number, because it can be changed into a prime (122330113040039) 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, 26921237394 + ... + 26921241937.
It is an arithmetic number, because the mean of its divisors is an integer number (10176228593748).
Almost surely, 2122330113040032 is an apocalyptic number.
It is an amenable number.
122330113040032 is a deficient number, since it is larger than the sum of its proper divisors (121899373209920).
122330113040032 is an equidigital number, since it uses as much as digits as its factorization.
122330113040032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53842479412 (or 53842479404 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 122330113040032 its reverse (230040311033221), we get a palindrome (352370424073253).
The spelling of 122330113040032 in words is "one hundred twenty-two trillion, three hundred thirty billion, one hundred thirteen million, forty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •