Base | Representation |
---|---|
bin | 10111000010110001010001… |
… | …010001000100101010010011 |
3 | 111021211112012222212201112002 |
4 | 113002301101101010222103 |
5 | 101240420400401341301 |
6 | 555313234525424215 |
7 | 30226651531246115 |
oct | 2702612121045223 |
9 | 437745188781462 |
10 | 101345411746451 |
11 | 2a323390952634 |
12 | b44950540b06b |
13 | 4471aa6546572 |
14 | 1b052035ab3b5 |
15 | bab36036716b |
hex | 5c2c51444a93 |
101345411746451 has 2 divisors, whose sum is σ = 101345411746452. Its totient is φ = 101345411746450.
The previous prime is 101345411746441. The next prime is 101345411746459. The reversal of 101345411746451 is 154647114543101.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101345411746451 is a prime.
It is a super-2 number, since 2×1013454117464512 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101345411746396 and 101345411746405.
It is not a weakly prime, because it can be changed into another prime (101345411746459) by changing a digit.
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 as a sum of consecutive naturals, namely, 50672705873225 + 50672705873226.
It is an arithmetic number, because the mean of its divisors is an integer number (50672705873226).
Almost surely, 2101345411746451 is an apocalyptic number.
101345411746451 is a deficient number, since it is larger than the sum of its proper divisors (1).
101345411746451 is an equidigital number, since it uses as much as digits as its factorization.
101345411746451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 806400, while the sum is 47.
The spelling of 101345411746451 in words is "one hundred one trillion, three hundred forty-five billion, four hundred eleven million, seven hundred forty-six thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •