Base | Representation |
---|---|
bin | 11000110100000000… |
… | …11101101100100100 |
3 | 1021101101020122202010 |
4 | 30122000131230210 |
5 | 204240213344030 |
6 | 10041504114220 |
7 | 651053411400 |
oct | 143200355444 |
9 | 37341218663 |
10 | 13321231140 |
11 | 5716540138 |
12 | 26b9305970 |
13 | 1343ac43b9 |
14 | 9052a8100 |
15 | 52e7566b0 |
hex | 31a01db24 |
13321231140 has 144 divisors (see below), whose sum is σ = 43609104000. Its totient is φ = 3029419008.
The previous prime is 13321231129. The next prime is 13321231177. The reversal of 13321231140 is 4113212331.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 573676 + ... + 596444.
It is an arithmetic number, because the mean of its divisors is an integer number (302841000).
Almost surely, 213321231140 is an apocalyptic number.
13321231140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13321231140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21804552000).
13321231140 is an abundant number, since it is smaller than the sum of its proper divisors (30287872860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13321231140 is a wasteful number, since it uses less digits than its factorization.
13321231140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22994 (or 22985 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 13321231140 its reverse (4113212331), we get a palindrome (17434443471).
The spelling of 13321231140 in words is "thirteen billion, three hundred twenty-one million, two hundred thirty-one thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •