Base | Representation |
---|---|
bin | 10001111011101011011… |
… | …110010010011101000011 |
3 | 11100210210212222210001201 |
4 | 101323223132102131003 |
5 | 130142233133413243 |
6 | 2342041014242031 |
7 | 155013551434363 |
oct | 21735336223503 |
9 | 4323725883051 |
10 | 1232311232323 |
11 | 435690623186 |
12 | 17a9b6656317 |
13 | 8c28b7586a2 |
14 | 439038c69a3 |
15 | 220c66a404d |
hex | 11eeb792743 |
1232311232323 has 24 divisors (see below), whose sum is σ = 1326467052288. Its totient is φ = 1144437956736.
The previous prime is 1232311232261. The next prime is 1232311232333. The reversal of 1232311232323 is 3232321132321.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-1232311232323 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1232311232291 and 1232311232300.
It is not an unprimeable number, because it can be changed into a prime (1232311232333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19710090 + ... + 19772512.
It is an arithmetic number, because the mean of its divisors is an integer number (55269460512).
Almost surely, 21232311232323 is an apocalyptic number.
1232311232323 is a deficient number, since it is larger than the sum of its proper divisors (94155819965).
1232311232323 is an equidigital number, since it uses as much as digits as its factorization.
1232311232323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63363 (or 63346 counting only the distinct ones).
The product of its digits is 7776, while the sum is 28.
Adding to 1232311232323 its reverse (3232321132321), we get a palindrome (4464632364644).
The spelling of 1232311232323 in words is "one trillion, two hundred thirty-two billion, three hundred eleven million, two hundred thirty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •