Base | Representation |
---|---|
bin | 10111000100100111001100… |
… | …110000110111000001101001 |
3 | 111022021122001210000002102221 |
4 | 113010213030300313001221 |
5 | 101300004213124301421 |
6 | 555451335515554041 |
7 | 30242053455321046 |
oct | 2704471460670151 |
9 | 438248053002387 |
10 | 101472037728361 |
11 | 2a37205aa21a63 |
12 | b469b6415b921 |
13 | 4480a063c1391 |
14 | 1b0b3b69101cd |
15 | bae7c1da6841 |
hex | 5c49ccc37069 |
101472037728361 has 2 divisors, whose sum is σ = 101472037728362. Its totient is φ = 101472037728360.
The previous prime is 101472037728359. The next prime is 101472037728377. The reversal of 101472037728361 is 163827730274101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 89358547291225 + 12113490437136 = 9452965^2 + 3480444^2 .
It is a cyclic number.
It is not a de Polignac number, because 101472037728361 - 21 = 101472037728359 is a prime.
Together with 101472037728359, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 101472037728299 and 101472037728308.
It is not a weakly prime, because it can be changed into another prime (101472037728161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50736018864180 + 50736018864181.
It is an arithmetic number, because the mean of its divisors is an integer number (50736018864181).
Almost surely, 2101472037728361 is an apocalyptic number.
It is an amenable number.
101472037728361 is a deficient number, since it is larger than the sum of its proper divisors (1).
101472037728361 is an equidigital number, since it uses as much as digits as its factorization.
101472037728361 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2370816, while the sum is 52.
The spelling of 101472037728361 in words is "one hundred one trillion, four hundred seventy-two billion, thirty-seven million, seven hundred twenty-eight thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •