Base | Representation |
---|---|
bin | 11000100111001001… |
… | …10100001101100000 |
3 | 1021002212012012112102 |
4 | 30103210310031200 |
5 | 204030102220112 |
6 | 10023051145532 |
7 | 645303236633 |
oct | 142344641540 |
9 | 37085165472 |
10 | 13213320032 |
11 | 5670635a00 |
12 | 26891452a8 |
13 | 1327640a83 |
14 | 8d4c17c1a |
15 | 52503cbc2 |
hex | 313934360 |
13213320032 has 72 divisors (see below), whose sum is σ = 28985910408. Its totient is φ = 5923653120.
The previous prime is 13213320017. The next prime is 13213320037. The reversal of 13213320032 is 23002331231.
It is a junction number, because it is equal to n+sod(n) for n = 13213319986 and 13213320013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13213320037) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 259283 + ... + 306029.
It is an arithmetic number, because the mean of its divisors is an integer number (402582089).
Almost surely, 213213320032 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 13213320032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14492955204).
13213320032 is an abundant number, since it is smaller than the sum of its proper divisors (15772590376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13213320032 is a wasteful number, since it uses less digits than its factorization.
13213320032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46852 (or 46833 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 13213320032 its reverse (23002331231), we get a palindrome (36215651263).
The spelling of 13213320032 in words is "thirteen billion, two hundred thirteen million, three hundred twenty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •