Base | Representation |
---|---|
bin | 11000010001111101… |
… | …11000111101001000 |
3 | 1020122110210101111000 |
4 | 30020332320331020 |
5 | 203144103341312 |
6 | 5553302135000 |
7 | 641014551504 |
oct | 141076707510 |
9 | 36573711430 |
10 | 13035605832 |
11 | 558a294667 |
12 | 2639721460 |
13 | 12c988a442 |
14 | 8b9397304 |
15 | 514636adc |
hex | 308fb8f48 |
13035605832 has 64 divisors (see below), whose sum is σ = 37052136000. Its totient is φ = 4244147712.
The previous prime is 13035605819. The next prime is 13035605903. The reversal of 13035605832 is 23850653031.
13035605832 is a `hidden beast` number, since 13 + 0 + 3 + 5 + 60 + 583 + 2 = 666.
13035605832 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 (36).
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 15 ways as a sum of consecutive naturals, for example, 692457 + ... + 711032.
It is an arithmetic number, because the mean of its divisors is an integer number (578939625).
Almost surely, 213035605832 is an apocalyptic number.
13035605832 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13035605832 is an abundant number, since it is smaller than the sum of its proper divisors (24016530168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13035605832 is a wasteful number, since it uses less digits than its factorization.
13035605832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1403547 (or 1403537 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 36.
The spelling of 13035605832 in words is "thirteen billion, thirty-five million, six hundred five thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •