Base | Representation |
---|---|
bin | 10101100010110010… |
… | …011011101010000011 |
3 | 2012201010100201222220 |
4 | 111202302123222003 |
5 | 334333322133011 |
6 | 14343215502123 |
7 | 1446144442452 |
oct | 254262335203 |
9 | 65633321886 |
10 | 23132224131 |
11 | 98a05a0405 |
12 | 4596b27943 |
13 | 22485a60b3 |
14 | 11962aab99 |
15 | 905c2c506 |
hex | 562c9ba83 |
23132224131 has 4 divisors (see below), whose sum is σ = 30842965512. Its totient is φ = 15421482752.
The previous prime is 23132224123. The next prime is 23132224147. The reversal of 23132224131 is 13142223132.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 23132224131 - 23 = 23132224123 is a prime.
It is a super-2 number, since 2×231322241312 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (23132222131) 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 3 ways as a sum of consecutive naturals, for example, 3855370686 + ... + 3855370691.
It is an arithmetic number, because the mean of its divisors is an integer number (7710741378).
Almost surely, 223132224131 is an apocalyptic number.
23132224131 is a deficient number, since it is larger than the sum of its proper divisors (7710741381).
23132224131 is an equidigital number, since it uses as much as digits as its factorization.
23132224131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7710741380.
The product of its digits is 1728, while the sum is 24.
Adding to 23132224131 its reverse (13142223132), we get a palindrome (36274447263).
Subtracting from 23132224131 its reverse (13142223132), we obtain a palindrome (9990000999).
The spelling of 23132224131 in words is "twenty-three billion, one hundred thirty-two million, two hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •