Base | Representation |
---|---|
bin | 10111000100100111001100… |
… | …110000110111000001100111 |
3 | 111022021122001210000002102212 |
4 | 113010213030300313001213 |
5 | 101300004213124301414 |
6 | 555451335515554035 |
7 | 30242053455321044 |
oct | 2704471460670147 |
9 | 438248053002385 |
10 | 101472037728359 |
11 | 2a37205aa21a61 |
12 | b469b6415b91b |
13 | 4480a063c138c |
14 | 1b0b3b69101cb |
15 | bae7c1da683e |
hex | 5c49ccc37067 |
101472037728359 has 2 divisors, whose sum is σ = 101472037728360. Its totient is φ = 101472037728358.
The previous prime is 101472037728349. The next prime is 101472037728361. The reversal of 101472037728359 is 953827730274101.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101472037728359 is a prime.
Together with 101472037728361, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 101472037728298 and 101472037728307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101472037728349) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50736018864179 + 50736018864180.
It is an arithmetic number, because the mean of its divisors is an integer number (50736018864180).
Almost surely, 2101472037728359 is an apocalyptic number.
101472037728359 is a deficient number, since it is larger than the sum of its proper divisors (1).
101472037728359 is an equidigital number, since it uses as much as digits as its factorization.
101472037728359 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17781120, while the sum is 59.
The spelling of 101472037728359 in words is "one hundred one trillion, four hundred seventy-two billion, thirty-seven million, seven hundred twenty-eight thousand, three hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •