Base | Representation |
---|---|
bin | 10010101100111011… |
… | …00111111111111101 |
3 | 221220202001100011121 |
4 | 21112131213333331 |
5 | 131030334304211 |
6 | 4340151350541 |
7 | 503546122546 |
oct | 112635477775 |
9 | 27822040147 |
10 | 10040541181 |
11 | 4292695220 |
12 | 1b42682451 |
13 | c40213438 |
14 | 6b36b74cd |
15 | 3db71a271 |
hex | 256767ffd |
10040541181 has 8 divisors (see below), whose sum is σ = 10954843200. Its totient is φ = 9126493440.
The previous prime is 10040541179. The next prime is 10040541221. The reversal of 10040541181 is 18114504001.
10040541181 is digitally balanced in base 3, because in such base 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.
It is a cyclic number.
It is not a de Polignac number, because 10040541181 - 21 = 10040541179 is a prime.
It is a super-2 number, since 2×100405411812 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10040541481) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24285 + ... + 143773.
It is an arithmetic number, because the mean of its divisors is an integer number (1369355400).
Almost surely, 210040541181 is an apocalyptic number.
10040541181 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10040541181 is a deficient number, since it is larger than the sum of its proper divisors (914302019).
10040541181 is a wasteful number, since it uses less digits than its factorization.
10040541181 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 127139.
The product of its (nonzero) digits is 640, while the sum is 25.
The spelling of 10040541181 in words is "ten billion, forty million, five hundred forty-one thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •