Base | Representation |
---|---|
bin | 10111000101111010000101… |
… | …001000011100001000010100 |
3 | 111022121010202211011021100002 |
4 | 113011322011020130020110 |
5 | 101302433442221411231 |
6 | 1000000254310510432 |
7 | 30251354002352531 |
oct | 2705720510341024 |
9 | 438533684137302 |
10 | 101561030263316 |
11 | 2a3a6877990708 |
12 | b48325b665418 |
13 | 44892195916a0 |
14 | 1b11819ab9d88 |
15 | bb1c7ea7a0cb |
hex | 5c5e8521c214 |
101561030263316 has 12 divisors (see below), whose sum is σ = 191403480111732. Its totient is φ = 46874321659968.
The previous prime is 101561030263309. The next prime is 101561030263321. The reversal of 101561030263316 is 613362030165101.
It can be written as a sum of positive squares in 2 ways, for example, as 65142170944900 + 36418859318416 = 8071070^2 + 6034804^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 101561030263316.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 976548367865 + ... + 976548367968.
It is an arithmetic number, because the mean of its divisors is an integer number (15950290009311).
Almost surely, 2101561030263316 is an apocalyptic number.
It is an amenable number.
101561030263316 is a deficient number, since it is larger than the sum of its proper divisors (89842449848416).
101561030263316 is a wasteful number, since it uses less digits than its factorization.
101561030263316 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1953096735850 (or 1953096735848 counting only the distinct ones).
The product of its (nonzero) digits is 58320, while the sum is 38.
The spelling of 101561030263316 in words is "one hundred one trillion, five hundred sixty-one billion, thirty million, two hundred sixty-three thousand, three hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •