Base | Representation |
---|---|
bin | 11000011000100000… |
… | …10101111000000000 |
3 | 1020210022002221010000 |
4 | 30030100111320000 |
5 | 203302132344014 |
6 | 10002543040000 |
7 | 642252343065 |
oct | 141420257000 |
9 | 36708087100 |
10 | 13090512384 |
11 | 5608286784 |
12 | 2653ba0000 |
13 | 1308072c21 |
14 | 8c27aac6c |
15 | 519380509 |
hex | 30c415e00 |
13090512384 has 400 divisors, whose sum is σ = 42333786000. Its totient is φ = 4013162496.
The previous prime is 13090512367. The next prime is 13090512443. The reversal of 13090512384 is 48321509031.
13090512384 is a `hidden beast` number, since 130 + 9 + 0 + 512 + 3 + 8 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 29154592 + ... + 29155040.
It is an arithmetic number, because the mean of its divisors is an integer number (105834465).
Almost surely, 213090512384 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13090512384, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21166893000).
13090512384 is an abundant number, since it is smaller than the sum of its proper divisors (29243273616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13090512384 is an equidigital number, since it uses as much as digits as its factorization.
13090512384 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 535 (or 510 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The spelling of 13090512384 in words is "thirteen billion, ninety million, five hundred twelve thousand, three hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •