Base | Representation |
---|---|
bin | 10110111101111100000110… |
… | …001110100111100011011111 |
3 | 111020122210100100002110100221 |
4 | 112331330012032213203133 |
5 | 101220001011211024301 |
6 | 554500533414102211 |
7 | 30163660134621562 |
oct | 2675740616474337 |
9 | 436583310073327 |
10 | 101013440329951 |
11 | 2a205617718976 |
12 | b3b50b894a967 |
13 | 44496acaa5836 |
14 | 1ad31102864d9 |
15 | ba28d0e65da1 |
hex | 5bdf063a78df |
101013440329951 has 2 divisors, whose sum is σ = 101013440329952. Its totient is φ = 101013440329950.
The previous prime is 101013440329939. The next prime is 101013440330137. The reversal of 101013440329951 is 159923044310101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101013440329951 - 215 = 101013440297183 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101013440329898 and 101013440329907.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101013440329051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50506720164975 + 50506720164976.
It is an arithmetic number, because the mean of its divisors is an integer number (50506720164976).
Almost surely, 2101013440329951 is an apocalyptic number.
101013440329951 is a deficient number, since it is larger than the sum of its proper divisors (1).
101013440329951 is an equidigital number, since it uses as much as digits as its factorization.
101013440329951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 116640, while the sum is 43.
The spelling of 101013440329951 in words is "one hundred one trillion, thirteen billion, four hundred forty million, three hundred twenty-nine thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •