Base | Representation |
---|---|
bin | 10111000011101110000000… |
… | …001111000010110111000101 |
3 | 111022001202112202201022112112 |
4 | 113003232000033002313011 |
5 | 101243002424302102011 |
6 | 555403221520030405 |
7 | 30234450543356042 |
oct | 2703560017026705 |
9 | 438052482638475 |
10 | 101410624253381 |
11 | 2a349005692263 |
12 | b45a084a62405 |
13 | 4477c99b78281 |
14 | 1b0842c43c1c9 |
15 | bacdca4eb58b |
hex | 5c3b803c2dc5 |
101410624253381 has 2 divisors, whose sum is σ = 101410624253382. Its totient is φ = 101410624253380.
The previous prime is 101410624253371. The next prime is 101410624253413. The reversal of 101410624253381 is 183352426014101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 97164588984100 + 4246035269281 = 9857210^2 + 2060591^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101410624253381 is a prime.
It is a super-2 number, since 2×1014106242533812 (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 (101410624253371) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50705312126690 + 50705312126691.
It is an arithmetic number, because the mean of its divisors is an integer number (50705312126691).
Almost surely, 2101410624253381 is an apocalyptic number.
It is an amenable number.
101410624253381 is a deficient number, since it is larger than the sum of its proper divisors (1).
101410624253381 is an equidigital number, since it uses as much as digits as its factorization.
101410624253381 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 138240, while the sum is 41.
The spelling of 101410624253381 in words is "one hundred one trillion, four hundred ten billion, six hundred twenty-four million, two hundred fifty-three thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •