Base | Representation |
---|---|
bin | 10110110111000011010010… |
… | …101111000111010111000011 |
3 | 111011222112122112021001002021 |
4 | 112313003102233013113003 |
5 | 101134222141241443133 |
6 | 553455255331502311 |
7 | 30114533101512643 |
oct | 2667032257072703 |
9 | 434875575231067 |
10 | 100540130031043 |
11 | 2a04291436598a |
12 | b339426157997 |
13 | 4413b80272c01 |
14 | 1ab824d9b0523 |
15 | b9542d52252d |
hex | 5b70d2bc75c3 |
100540130031043 has 8 divisors (see below), whose sum is σ = 100639852713360. Its totient is φ = 100440423683040.
The previous prime is 100540130031017. The next prime is 100540130031049. The reversal of 100540130031043 is 340130031045001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100540130031043 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100540130030999 and 100540130031017.
It is not an unprimeable number, because it can be changed into a prime (100540130031049) 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, 8251288 + ... + 16406218.
It is an arithmetic number, because the mean of its divisors is an integer number (12579981589170).
Almost surely, 2100540130031043 is an apocalyptic number.
100540130031043 is a deficient number, since it is larger than the sum of its proper divisors (99722682317).
100540130031043 is a wasteful number, since it uses less digits than its factorization.
100540130031043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8167157.
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 100540130031043 its reverse (340130031045001), we get a palindrome (440670161076044).
The spelling of 100540130031043 in words is "one hundred trillion, five hundred forty billion, one hundred thirty million, thirty-one thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •