Base | Representation |
---|---|
bin | 11011101111110001100000… |
… | …100000110010010000001011 |
3 | 121000001222100112202001221210 |
4 | 123233301200200302100023 |
5 | 111443320402341134011 |
6 | 1111311525212104203 |
7 | 34463251600502505 |
oct | 3357614040622013 |
9 | 530058315661853 |
10 | 122030230021131 |
11 | 35978803586333 |
12 | 1182a339165063 |
13 | 531252a8c1bc3 |
14 | 221c41a722d75 |
15 | e194465466a6 |
hex | 6efc6083240b |
122030230021131 has 32 divisors (see below), whose sum is σ = 165692592172800. Its totient is φ = 79864491294720.
The previous prime is 122030230021103. The next prime is 122030230021151. The reversal of 122030230021131 is 131120032030221.
It is not a de Polignac number, because 122030230021131 - 214 = 122030230004747 is a prime.
It is a super-2 number, since 2×1220302300211312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122030230021098 and 122030230021107.
It is not an unprimeable number, because it can be changed into a prime (122030230021151) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2380726855 + ... + 2380778111.
It is an arithmetic number, because the mean of its divisors is an integer number (5177893505400).
Almost surely, 2122030230021131 is an apocalyptic number.
122030230021131 is a deficient number, since it is larger than the sum of its proper divisors (43662362151669).
122030230021131 is a wasteful number, since it uses less digits than its factorization.
122030230021131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69579.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 122030230021131 its reverse (131120032030221), we get a palindrome (253150262051352).
The spelling of 122030230021131 in words is "one hundred twenty-two trillion, thirty billion, two hundred thirty million, twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •