Base | Representation |
---|---|
bin | 11000101000010100… |
… | …01111100001100000 |
3 | 1021010112122122222012 |
4 | 30110022033201200 |
5 | 204040110144412 |
6 | 10024041332052 |
7 | 645452522003 |
oct | 142412174140 |
9 | 37115578865 |
10 | 13223131232 |
11 | 5676127233 |
12 | 2690497028 |
13 | 132969770c |
14 | 8d624d53a |
15 | 525d29c22 |
hex | 31428f860 |
13223131232 has 72 divisors (see below), whose sum is σ = 26757399816. Its totient is φ = 6431353344.
The previous prime is 13223131231. The next prime is 13223131261. The reversal of 13223131232 is 23213132231.
It is a junction number, because it is equal to n+sod(n) for n = 13223131198 and 13223131207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13223131231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 14578523 + ... + 14579429.
It is an arithmetic number, because the mean of its divisors is an integer number (371630553).
Almost surely, 213223131232 is an apocalyptic number.
It is an amenable number.
13223131232 is an abundant number, since it is smaller than the sum of its proper divisors (13534268584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13223131232 is an frugal number, since it uses more digits than its factorization.
13223131232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1148 (or 1061 counting only the distinct ones).
The product of its digits is 1296, while the sum is 23.
Adding to 13223131232 its reverse (23213132231), we get a palindrome (36436263463).
Subtracting 13223131232 from its reverse (23213132231), we obtain a palindrome (9990000999).
The spelling of 13223131232 in words is "thirteen billion, two hundred twenty-three million, one hundred thirty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •