Base | Representation |
---|---|
bin | 11000010001101011… |
… | …10101001010011000 |
3 | 1020122022022201211021 |
4 | 30020311311022120 |
5 | 203143001343000 |
6 | 5553135212224 |
7 | 640655431006 |
oct | 141065651230 |
9 | 36568281737 |
10 | 13033231000 |
11 | 5588a12399 |
12 | 2638977074 |
13 | 12c923850a |
14 | 8b8d39a76 |
15 | 51431811a |
hex | 308d75298 |
13033231000 has 64 divisors (see below), whose sum is σ = 30555401760. Its totient is φ = 5203440000.
The previous prime is 13033230983. The next prime is 13033231009. The reversal of 13033231000 is 13233031.
It is a super-2 number, since 2×130332310002 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13033231009) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 528955 + ... + 553045.
Almost surely, 213033231000 is an apocalyptic number.
13033231000 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 13033231000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15277700880).
13033231000 is an abundant number, since it is smaller than the sum of its proper divisors (17522170760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13033231000 is a wasteful number, since it uses less digits than its factorization.
13033231000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24653 (or 24639 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 16.
Adding to 13033231000 its reverse (13233031), we get a palindrome (13046464031).
The spelling of 13033231000 in words is "thirteen billion, thirty-three million, two hundred thirty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •