Base | Representation |
---|---|
bin | 101111001011101110… |
… | …1111010110100001111 |
3 | 100200112112201012112101 |
4 | 1132113131322310033 |
5 | 3130003303404021 |
6 | 114314232015531 |
7 | 10214640055465 |
oct | 1362735726417 |
9 | 320475635471 |
10 | 101325450511 |
11 | 39a7663674a |
12 | 177798315a7 |
13 | 972a2b899c |
14 | 4c930c8835 |
15 | 29807a5a91 |
hex | 179777ad0f |
101325450511 has 8 divisors (see below), whose sum is σ = 102132011520. Its totient is φ = 100519026048.
The previous prime is 101325450439. The next prime is 101325450517. The reversal of 101325450511 is 115054523101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101325450511 - 219 = 101324926223 is a prime.
It is a super-2 number, since 2×1013254505112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101325450511.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101325450517) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1880595 + ... + 1933723.
It is an arithmetic number, because the mean of its divisors is an integer number (12766501440).
Almost surely, 2101325450511 is an apocalyptic number.
101325450511 is a deficient number, since it is larger than the sum of its proper divisors (806561009).
101325450511 is a wasteful number, since it uses less digits than its factorization.
101325450511 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68273.
The product of its (nonzero) digits is 3000, while the sum is 28.
Adding to 101325450511 its reverse (115054523101), we get a palindrome (216379973612).
The spelling of 101325450511 in words is "one hundred one billion, three hundred twenty-five million, four hundred fifty thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •