Base | Representation |
---|---|
bin | 10110111110001001001111… |
… | …100010010001100100000101 |
3 | 111020201010210000120011020002 |
4 | 112332021033202101210011 |
5 | 101220213413102341123 |
6 | 554511230151051045 |
7 | 30164666665436234 |
oct | 2676111742214405 |
9 | 436633700504202 |
10 | 101027555121413 |
11 | 2a2106000a0688 |
12 | b3b7997970a85 |
13 | 444ab1c10694b |
14 | 1ad3a8cac0b1b |
15 | ba2e5a1c1528 |
hex | 5be24f891905 |
101027555121413 has 2 divisors, whose sum is σ = 101027555121414. Its totient is φ = 101027555121412.
The previous prime is 101027555121391. The next prime is 101027555121419. The reversal of 101027555121413 is 314121555720101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 93476837028964 + 7550718092449 = 9668342^2 + 2747857^2 .
It is a cyclic number.
It is not a de Polignac number, because 101027555121413 - 210 = 101027555120389 is a prime.
It is a super-3 number, since 3×1010275551214133 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101027555121419) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50513777560706 + 50513777560707.
It is an arithmetic number, because the mean of its divisors is an integer number (50513777560707).
Almost surely, 2101027555121413 is an apocalyptic number.
It is an amenable number.
101027555121413 is a deficient number, since it is larger than the sum of its proper divisors (1).
101027555121413 is an equidigital number, since it uses as much as digits as its factorization.
101027555121413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 42000, while the sum is 38.
The spelling of 101027555121413 in words is "one hundred one trillion, twenty-seven billion, five hundred fifty-five million, one hundred twenty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •