Base | Representation |
---|---|
bin | 11101001110011000000… |
… | …01111111101011111000 |
3 | 10112222212222020101102210 |
4 | 32213030001333223320 |
5 | 112423000004030112 |
6 | 2045144513055120 |
7 | 132355533016014 |
oct | 16471401775370 |
9 | 3488788211383 |
10 | 1004150455032 |
11 | 35794883221a |
12 | 14273bb574a0 |
13 | 738ca1182aa |
14 | 3685b763544 |
15 | 1b1c0d0ab3c |
hex | e9cc07faf8 |
1004150455032 has 64 divisors (see below), whose sum is σ = 2539145306880. Its totient is φ = 330892204032.
The previous prime is 1004150455003. The next prime is 1004150455039. The reversal of 1004150455032 is 2305540514001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1004150455039) by changing a digit.
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, 1074343 + ... + 1778345.
It is an arithmetic number, because the mean of its divisors is an integer number (39674145420).
Almost surely, 21004150455032 is an apocalyptic number.
1004150455032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1004150455032 is an abundant number, since it is smaller than the sum of its proper divisors (1534994851848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1004150455032 is a wasteful number, since it uses less digits than its factorization.
1004150455032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 704692 (or 704688 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 30.
Adding to 1004150455032 its reverse (2305540514001), we get a palindrome (3309690969033).
The spelling of 1004150455032 in words is "one trillion, four billion, one hundred fifty million, four hundred fifty-five thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •