Base | Representation |
---|---|
bin | 11000110001100111… |
… | …10010100010110110 |
3 | 1021022222102111011000 |
4 | 30120303302202312 |
5 | 204220042201241 |
6 | 10035505224130 |
7 | 650420515611 |
oct | 143063624266 |
9 | 37288374130 |
10 | 13301131446 |
11 | 5706161a19 |
12 | 26b2632046 |
13 | 133c8a77a5 |
14 | 902755178 |
15 | 52cad5eb6 |
hex | 318cf28b6 |
13301131446 has 16 divisors (see below), whose sum is σ = 29558070000. Its totient is φ = 4433710464.
The previous prime is 13301131439. The next prime is 13301131451. The reversal of 13301131446 is 64413110331.
13301131446 is a `hidden beast` number, since 1 + 3 + 301 + 1 + 314 + 46 = 666.
13301131446 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 (27).
It is a congruent number.
It is an unprimeable number.
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, 123158571 + ... + 123158678.
It is an arithmetic number, because the mean of its divisors is an integer number (1847379375).
Almost surely, 213301131446 is an apocalyptic number.
13301131446 is an abundant number, since it is smaller than the sum of its proper divisors (16256938554).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13301131446 is a wasteful number, since it uses less digits than its factorization.
13301131446 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 246317260 (or 246317254 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 13301131446 its reverse (64413110331), we get a palindrome (77714241777).
The spelling of 13301131446 in words is "thirteen billion, three hundred one million, one hundred thirty-one thousand, four hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •