Base | Representation |
---|---|
bin | 10111000101010000111101… |
… | …110010100001000011001111 |
3 | 111022102220211011112111211022 |
4 | 113011100331302201003033 |
5 | 101301223034204123012 |
6 | 555524113523544355 |
7 | 30245232004416263 |
oct | 2705207562410317 |
9 | 438386734474738 |
10 | 101516883661007 |
11 | 2a38a083317a11 |
12 | b47679ab2b0bb |
13 | 448500240b1b9 |
14 | 1b0d62c9160a3 |
15 | bb0a49010472 |
hex | 5c543dca10cf |
101516883661007 has 16 divisors (see below), whose sum is σ = 102503487240000. Its totient is φ = 100531297684224.
The previous prime is 101516883660943. The next prime is 101516883661021. The reversal of 101516883661007 is 700166388615101.
It is a cyclic number.
It is not a de Polignac number, because 101516883661007 - 26 = 101516883660943 is a prime.
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 101516883661007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101516883661027) 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 in 15 ways as a sum of consecutive naturals, for example, 2017040219 + ... + 2017090547.
It is an arithmetic number, because the mean of its divisors is an integer number (6406467952500).
Almost surely, 2101516883661007 is an apocalyptic number.
101516883661007 is a deficient number, since it is larger than the sum of its proper divisors (986603578993).
101516883661007 is a wasteful number, since it uses less digits than its factorization.
101516883661007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60050.
The product of its (nonzero) digits is 1451520, while the sum is 53.
The spelling of 101516883661007 in words is "one hundred one trillion, five hundred sixteen billion, eight hundred eighty-three million, six hundred sixty-one thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •