Base | Representation |
---|---|
bin | 100001111011000010001… |
… | …011101010000010101001 |
3 | 22020212001110120022201201 |
4 | 201323002023222002221 |
5 | 301143123302010441 |
6 | 4542523440244201 |
7 | 330263402000101 |
oct | 41730213520251 |
9 | 8225043508651 |
10 | 2331130110121 |
11 | 8196991a161a |
12 | 317956910661 |
13 | 13ba9491bb87 |
14 | 80b82176201 |
15 | 409885e7c31 |
hex | 21ec22ea0a9 |
2331130110121 has 4 divisors (see below), whose sum is σ = 2331133281792. Its totient is φ = 2331126938452.
The previous prime is 2331130110109. The next prime is 2331130110143. The reversal of 2331130110121 is 1210110311332.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 2331130110121 - 229 = 2330593239209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2331130110161) 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, 149940 + ... + 2164426.
It is an arithmetic number, because the mean of its divisors is an integer number (582783320448).
Almost surely, 22331130110121 is an apocalyptic number.
It is an amenable number.
2331130110121 is a deficient number, since it is larger than the sum of its proper divisors (3171671).
2331130110121 is a wasteful number, since it uses less digits than its factorization.
2331130110121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3171670.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 2331130110121 its reverse (1210110311332), we get a palindrome (3541240421453).
The spelling of 2331130110121 in words is "two trillion, three hundred thirty-one billion, one hundred thirty million, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •