Base | Representation |
---|---|
bin | 11000101001010010… |
… | …11101000010001000 |
3 | 1021011010001100021211 |
4 | 30110221131002020 |
5 | 204044204004112 |
6 | 10024532542504 |
7 | 645612206440 |
oct | 142451350210 |
9 | 37133040254 |
10 | 13231313032 |
11 | 567a805353 |
12 | 2693181a34 |
13 | 132b2a0812 |
14 | 8d737d120 |
15 | 5268e40a7 |
hex | 314a5d088 |
13231313032 has 64 divisors (see below), whose sum is σ = 29081888640. Its totient is φ = 5525107200.
The previous prime is 13231312987. The next prime is 13231313041. The reversal of 13231313032 is 23031313231.
It is a junction number, because it is equal to n+sod(n) for n = 13231312994 and 13231313012.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 2010307 + ... + 2016877.
It is an arithmetic number, because the mean of its divisors is an integer number (454404510).
Almost surely, 213231313032 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13231313032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14540944320).
13231313032 is an abundant number, since it is smaller than the sum of its proper divisors (15850575608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13231313032 is a wasteful number, since it uses less digits than its factorization.
13231313032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7502 (or 7498 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 13231313032 its reverse (23031313231), we get a palindrome (36262626263).
The spelling of 13231313032 in words is "thirteen billion, two hundred thirty-one million, three hundred thirteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •