Base | Representation |
---|---|
bin | 1001001110010010001101… |
… | …0111010100110101000000 |
3 | 1022220110201111111111012022 |
4 | 2103210203113110311000 |
5 | 2312122242320244130 |
6 | 33322414410221012 |
7 | 2064443465060006 |
oct | 223444327246500 |
9 | 38813644444168 |
10 | 10141011103040 |
11 | 325a862434904 |
12 | 1179490124768 |
13 | 5873a734432c |
14 | 270b82b58a76 |
15 | 128bce7da7e5 |
hex | 939235d4d40 |
10141011103040 has 28 divisors (see below), whose sum is σ = 24148282689876. Its totient is φ = 4056404441088.
The previous prime is 10141011103033. The next prime is 10141011103109. The reversal of 10141011103040 is 4030111014101.
It can be written as a sum of positive squares in 2 ways, for example, as 3989063485696 + 6151947617344 = 1997264^2 + 2480312^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15845329529 + ... + 15845330168.
Almost surely, 210141011103040 is an apocalyptic number.
10141011103040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10141011103040 is an abundant number, since it is smaller than the sum of its proper divisors (14007271586836).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10141011103040 is an equidigital number, since it uses as much as digits as its factorization.
10141011103040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31690659714 (or 31690659704 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 10141011103040 its reverse (4030111014101), we get a palindrome (14171122117141).
The spelling of 10141011103040 in words is "ten trillion, one hundred forty-one billion, eleven million, one hundred three thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •