Base | Representation |
---|---|
bin | 100001111100000011110… |
… | …100011010001011111001 |
3 | 22020221220012200011212222 |
4 | 201330003310122023321 |
5 | 301202402203441441 |
6 | 4543225015013425 |
7 | 330332603030414 |
oct | 41740364321371 |
9 | 8227805604788 |
10 | 2332231312121 |
11 | 81a103857a17 |
12 | 31800366a275 |
13 | 13bc0bb009a9 |
14 | 80c48508b7b |
15 | 40a00119d4b |
hex | 21f03d1a2f9 |
2332231312121 has 8 divisors (see below), whose sum is σ = 2333066776320. Its totient is φ = 2331395998272.
The previous prime is 2332231312093. The next prime is 2332231312127. The reversal of 2332231312121 is 1212131322332.
2332231312121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 2332231312121 - 26 = 2332231312057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2332231312127) 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, 37354496 + ... + 37416878.
It is an arithmetic number, because the mean of its divisors is an integer number (291633347040).
Almost surely, 22332231312121 is an apocalyptic number.
It is an amenable number.
2332231312121 is a deficient number, since it is larger than the sum of its proper divisors (835464199).
2332231312121 is an equidigital number, since it uses as much as digits as its factorization.
2332231312121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75175.
The product of its digits is 2592, while the sum is 26.
Adding to 2332231312121 its reverse (1212131322332), we get a palindrome (3544362634453).
The spelling of 2332231312121 in words is "two trillion, three hundred thirty-two billion, two hundred thirty-one million, three hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.158 sec. • engine limits •