Base | Representation |
---|---|
bin | 11101001110000111110… |
… | …10100111001110110100 |
3 | 10112222112111001002202210 |
4 | 32213003322213032310 |
5 | 112422210130132012 |
6 | 2045123210533420 |
7 | 132352260520542 |
oct | 16470372471664 |
9 | 3488474032683 |
10 | 1004014302132 |
11 | 357888998566 |
12 | 142702437270 |
13 | 738a7b5704a |
14 | 36847640d92 |
15 | 1b1b3db423c |
hex | e9c3ea73b4 |
1004014302132 has 48 divisors (see below), whose sum is σ = 2345979347712. Its totient is φ = 334203208320.
The previous prime is 1004014302091. The next prime is 1004014302143. The reversal of 1004014302132 is 2312034104001.
It is a junction number, because it is equal to n+sod(n) for n = 1004014302099 and 1004014302108.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 37735858 + ... + 37762454.
It is an arithmetic number, because the mean of its divisors is an integer number (48874569744).
Almost surely, 21004014302132 is an apocalyptic number.
1004014302132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1004014302132 is an abundant number, since it is smaller than the sum of its proper divisors (1341965045580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1004014302132 is a wasteful number, since it uses less digits than its factorization.
1004014302132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30888 (or 30886 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 1004014302132 its reverse (2312034104001), we get a palindrome (3316048406133).
The spelling of 1004014302132 in words is "one trillion, four billion, fourteen million, three hundred two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •