Base | Representation |
---|---|
bin | 11000001101101111… |
… | …11010000101010100 |
3 | 1020120000012122122010 |
4 | 30012313322011110 |
5 | 203111024033022 |
6 | 5545555504220 |
7 | 640105024662 |
oct | 140667720524 |
9 | 36500178563 |
10 | 13000221012 |
11 | 5571316509 |
12 | 26298b8070 |
13 | 12c244b48c |
14 | 8b47c5c32 |
15 | 51149750c |
hex | 306dfa154 |
13000221012 has 24 divisors (see below), whose sum is σ = 30337328896. Its totient is φ = 4332909888.
The previous prime is 13000220999. The next prime is 13000221019. The reversal of 13000221012 is 21012200031.
13000221012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13000221019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55773 + ... + 170619.
Almost surely, 213000221012 is an apocalyptic number.
13000221012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13000221012 is an abundant number, since it is smaller than the sum of its proper divisors (17337107884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13000221012 is a wasteful number, since it uses less digits than its factorization.
13000221012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124287 (or 124285 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 13000221012 its reverse (21012200031), we get a palindrome (34012421043).
The spelling of 13000221012 in words is "thirteen billion, two hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •