Base | Representation |
---|---|
bin | 10110111110100011110111… |
… | …111111100000011100110001 |
3 | 111020210212120221001110110111 |
4 | 112332203313333200130301 |
5 | 101221200444144120000 |
6 | 554532315511301321 |
7 | 30200031426655033 |
oct | 2676436777403461 |
9 | 436725527043414 |
10 | 101056151160625 |
11 | 2a221744890141 |
12 | b40143867a841 |
13 | 44507286644cb |
14 | 1ad52028a5c53 |
15 | ba3a80921cba |
hex | 5be8f7fe0731 |
101056151160625 has 10 divisors (see below), whose sum is σ = 126279766491098. Its totient is φ = 80844920928000.
The previous prime is 101056151160623. The next prime is 101056151160709. The reversal of 101056151160625 is 526061151650101.
It is a happy number.
It can be written as a sum of positive squares in 5 ways, for example, as 36195420485169 + 64860730675456 = 6016263^2 + 8053616^2 .
It is not a de Polignac number, because 101056151160625 - 21 = 101056151160623 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101056151160623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 80844920304 + ... + 80844921553.
Almost surely, 2101056151160625 is an apocalyptic number.
It is an amenable number.
101056151160625 is a deficient number, since it is larger than the sum of its proper divisors (25223615330473).
101056151160625 is an frugal number, since it uses more digits than its factorization.
101056151160625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161689841877 (or 161689841862 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 40.
The spelling of 101056151160625 in words is "one hundred one trillion, fifty-six billion, one hundred fifty-one million, one hundred sixty thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •