Base | Representation |
---|---|
bin | 11101011001010001100… |
… | …00000111010101110110 |
3 | 10120112222201002200112210 |
4 | 32230220300013111312 |
5 | 113021440230004212 |
6 | 2051553230554250 |
7 | 132653523662424 |
oct | 16545060072566 |
9 | 3515881080483 |
10 | 1010001016182 |
11 | 35a380274424 |
12 | 1438b3368986 |
13 | 743202506b2 |
14 | 36c54792114 |
15 | 1b41477553c |
hex | eb28c07576 |
1010001016182 has 8 divisors (see below), whose sum is σ = 2020002032376. Its totient is φ = 336667005392.
The previous prime is 1010001016121. The next prime is 1010001016183. The reversal of 1010001016182 is 2816101000101.
It is a happy number.
1010001016182 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
1010001016182 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010001016183) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 84166751343 + ... + 84166751354.
It is an arithmetic number, because the mean of its divisors is an integer number (252500254047).
Almost surely, 21010001016182 is an apocalyptic number.
1010001016182 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010001016182 is a wasteful number, since it uses less digits than its factorization.
1010001016182 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 168333502702.
The product of its (nonzero) digits is 96, while the sum is 21.
Adding to 1010001016182 its reverse (2816101000101), we get a palindrome (3826102016283).
The spelling of 1010001016182 in words is "one trillion, ten billion, one million, sixteen thousand, one hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •