Base | Representation |
---|---|
bin | 11011101111010101010110… |
… | …110110010110111011001011 |
3 | 120222222002022222112001202102 |
4 | 123233111112312112323023 |
5 | 111442322001300230011 |
6 | 1111250005553024015 |
7 | 34461131544261554 |
oct | 3357252666267313 |
9 | 528862288461672 |
10 | 122000003133131 |
11 | 35966a02264a62 |
12 | 1182450225500b |
13 | 530c72151a166 |
14 | 221ab900d732b |
15 | e18777a5173b |
hex | 6ef556d96ecb |
122000003133131 has 8 divisors (see below), whose sum is σ = 122146551785664. Its totient is φ = 121853482179520.
The previous prime is 122000003133079. The next prime is 122000003133133. The reversal of 122000003133131 is 131331300000221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 122000003133131 - 242 = 117601956622027 is a prime.
It is a super-2 number, since 2×1220000031331312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122000003133133) 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, 1896311 + ... + 15735183.
It is an arithmetic number, because the mean of its divisors is an integer number (15268318973208).
Almost surely, 2122000003133131 is an apocalyptic number.
122000003133131 is a deficient number, since it is larger than the sum of its proper divisors (146548652533).
122000003133131 is an equidigital number, since it uses as much as digits as its factorization.
122000003133131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13849461.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 122000003133131 its reverse (131331300000221), we get a palindrome (253331303133352).
The spelling of 122000003133131 in words is "one hundred twenty-two trillion, three million, one hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •