Base | Representation |
---|---|
bin | 10110110101100000110101… |
… | …010110110110100111110011 |
3 | 111011121102202202012000100102 |
4 | 112311200311112312213303 |
5 | 101131004133032324021 |
6 | 553334533045543015 |
7 | 30104101213662344 |
oct | 2665406526664763 |
9 | 434542682160312 |
10 | 100434410433011 |
11 | 2a001aa3408166 |
12 | b320a40a14a6b |
13 | 4406c027c3045 |
14 | 1ab30a10920cb |
15 | b927e20dc00b |
hex | 5b58355b69f3 |
100434410433011 has 8 divisors (see below), whose sum is σ = 100453760139264. Its totient is φ = 100415061802440.
The previous prime is 100434410432963. The next prime is 100434410433023. The reversal of 100434410433011 is 110334014434001.
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 100434410433011 - 230 = 100433336691187 is a prime.
It is a super-2 number, since 2×1004344104330112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100434410432011) 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, 200817320 + ... + 201316826.
It is an arithmetic number, because the mean of its divisors is an integer number (12556720017408).
Almost surely, 2100434410433011 is an apocalyptic number.
100434410433011 is a deficient number, since it is larger than the sum of its proper divisors (19349706253).
100434410433011 is an equidigital number, since it uses as much as digits as its factorization.
100434410433011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 537841.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 100434410433011 its reverse (110334014434001), we get a palindrome (210768424867012).
The spelling of 100434410433011 in words is "one hundred trillion, four hundred thirty-four billion, four hundred ten million, four hundred thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •