Base | Representation |
---|---|
bin | 10101100010101110… |
… | …101001010001011001 |
3 | 2012201001111022010011 |
4 | 111202232221101121 |
5 | 334333043400241 |
6 | 14343142321521 |
7 | 1446133136122 |
oct | 254256512131 |
9 | 65631438104 |
10 | 23131231321 |
11 | 989aa82500 |
12 | 45967292a1 |
13 | 2248319233 |
14 | 11960cd049 |
15 | 905ad3281 |
hex | 562ba9459 |
23131231321 has 12 divisors (see below), whose sum is σ = 25471791856. Its totient is φ = 20989888920.
The previous prime is 23131231309. The next prime is 23131231337. The reversal of 23131231321 is 12313213132.
It is not a de Polignac number, because 23131231321 - 223 = 23122842713 is a prime.
It is a super-2 number, since 2×231312313212 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23131231292 and 23131231301.
It is not an unprimeable number, because it can be changed into a prime (23131231301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 108555 + ... + 240928.
Almost surely, 223131231321 is an apocalyptic number.
It is an amenable number.
23131231321 is a deficient number, since it is larger than the sum of its proper divisors (2340560535).
23131231321 is a wasteful number, since it uses less digits than its factorization.
23131231321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 350052 (or 350041 counting only the distinct ones).
The product of its digits is 648, while the sum is 22.
Adding to 23131231321 its reverse (12313213132), we get a palindrome (35444444453).
It can be divided in two parts, 23131 and 231321, that added together give a palindrome (254452).
The spelling of 23131231321 in words is "twenty-three billion, one hundred thirty-one million, two hundred thirty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •