Base | Representation |
---|---|
bin | 11011110100001000110011… |
… | …100010010010001111100111 |
3 | 121001010122102121120111111101 |
4 | 123310020303202102033213 |
5 | 112013224043011302221 |
6 | 1112101403250420531 |
7 | 34524026330155336 |
oct | 3364106342221747 |
9 | 531118377514441 |
10 | 122330123150311 |
11 | 35a83a06418a3a |
12 | 11878492891747 |
13 | 53348b154282b |
14 | 222cb495a5d1d |
15 | e22149644d91 |
hex | 6f42338923e7 |
122330123150311 has 16 divisors (see below), whose sum is σ = 125665145668800. Its totient is φ = 118996620341760.
The previous prime is 122330123150267. The next prime is 122330123150321. The reversal of 122330123150311 is 113051321033221.
It is a cyclic number.
It is not a de Polignac number, because 122330123150311 - 223 = 122330114761703 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 122330123150311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122330123150321) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3870333270 + ... + 3870364876.
It is an arithmetic number, because the mean of its divisors is an integer number (7854071604300).
Almost surely, 2122330123150311 is an apocalyptic number.
122330123150311 is a deficient number, since it is larger than the sum of its proper divisors (3335022518489).
122330123150311 is a wasteful number, since it uses less digits than its factorization.
122330123150311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52314.
The product of its (nonzero) digits is 3240, while the sum is 28.
Adding to 122330123150311 its reverse (113051321033221), we get a palindrome (235381444183532).
The spelling of 122330123150311 in words is "one hundred twenty-two trillion, three hundred thirty billion, one hundred twenty-three million, one hundred fifty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •