Base | Representation |
---|---|
bin | 10111011100011100110010… |
… | …111000000100000001011011 |
3 | 111112002020021111001211222001 |
4 | 113130130302320010001123 |
5 | 102003324023124314121 |
6 | 1003144050311541431 |
7 | 30501314141134510 |
oct | 2734346270040133 |
9 | 445066244054861 |
10 | 103110133432411 |
11 | 2a943842279786 |
12 | b69352708a877 |
13 | 456c3229c0921 |
14 | 1b667b2903307 |
15 | bdc1e7bb6991 |
hex | 5dc732e0405b |
103110133432411 has 8 divisors (see below), whose sum is σ = 117840483180000. Its totient is φ = 88379866356288.
The previous prime is 103110133432391. The next prime is 103110133432441. The reversal of 103110133432411 is 114234331011301.
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 103110133432411 - 231 = 103107985948763 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 103110133432411.
It is not an unprimeable number, because it can be changed into a prime (103110133432441) 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, 17971786 + ... + 23004463.
It is an arithmetic number, because the mean of its divisors is an integer number (14730060397500).
Almost surely, 2103110133432411 is an apocalyptic number.
103110133432411 is a deficient number, since it is larger than the sum of its proper divisors (14730349747589).
103110133432411 is an equidigital number, since it uses as much as digits as its factorization.
103110133432411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41335733.
The product of its (nonzero) digits is 2592, while the sum is 28.
Adding to 103110133432411 its reverse (114234331011301), we get a palindrome (217344464443712).
The spelling of 103110133432411 in words is "one hundred three trillion, one hundred ten billion, one hundred thirty-three million, four hundred thirty-two thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •