Base | Representation |
---|---|
bin | 10110110000101101011011… |
… | …101100010100111101010111 |
3 | 111010102212210122112100101202 |
4 | 112300231123230110331113 |
5 | 101110102142311132321 |
6 | 552523144402543115 |
7 | 30041204615033663 |
oct | 2660553354247527 |
9 | 433385718470352 |
10 | 100104341114711 |
11 | 29995015931a8a |
12 | b288a85367a9b |
13 | 43b1a5013bbcb |
14 | 1aa110c61d8a3 |
15 | b88e24bb070b |
hex | 5b0b5bb14f57 |
100104341114711 has 2 divisors, whose sum is σ = 100104341114712. Its totient is φ = 100104341114710.
The previous prime is 100104341114693. The next prime is 100104341114773. The reversal of 100104341114711 is 117411143401001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100104341114711 - 234 = 100087161245527 is a prime.
It is a super-2 number, since 2×1001043411147112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100104341174711) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50052170557355 + 50052170557356.
It is an arithmetic number, because the mean of its divisors is an integer number (50052170557356).
Almost surely, 2100104341114711 is an apocalyptic number.
100104341114711 is a deficient number, since it is larger than the sum of its proper divisors (1).
100104341114711 is an equidigital number, since it uses as much as digits as its factorization.
100104341114711 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1344, while the sum is 29.
Adding to 100104341114711 its reverse (117411143401001), we get a palindrome (217515484515712).
The spelling of 100104341114711 in words is "one hundred trillion, one hundred four billion, three hundred forty-one million, one hundred fourteen thousand, seven hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •