Base | Representation |
---|---|
bin | 11000110101001101… |
… | …01100101011110000 |
3 | 1021102002002212112011 |
4 | 30122212230223300 |
5 | 204300300112000 |
6 | 10042503012304 |
7 | 651234534511 |
oct | 143246545360 |
9 | 37362085464 |
10 | 13331254000 |
11 | 5721166499 |
12 | 270073a094 |
13 | 1345bc349c |
14 | 906756a08 |
15 | 5305862ba |
hex | 31a9acaf0 |
13331254000 has 40 divisors (see below), whose sum is σ = 32234977008. Its totient is φ = 5332500800.
The previous prime is 13331253989. The next prime is 13331254003. The reversal of 13331254000 is 45213331.
13331254000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13331254003) 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, 3330814 + ... + 3334813.
Almost surely, 213331254000 is an apocalyptic number.
13331254000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13331254000 is an abundant number, since it is smaller than the sum of its proper divisors (18903723008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13331254000 is an equidigital number, since it uses as much as digits as its factorization.
13331254000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6665650 (or 6665634 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 22.
Adding to 13331254000 its reverse (45213331), we get a palindrome (13376467331).
The spelling of 13331254000 in words is "thirteen billion, three hundred thirty-one million, two hundred fifty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •