Base | Representation |
---|---|
bin | 11000001011000111000101… |
… | …000111010101101101010101 |
3 | 111221102202210220210022221120 |
4 | 120023013011013111231111 |
5 | 102413342430410411430 |
6 | 1014041104155234153 |
7 | 31252060156462521 |
oct | 3013070507255525 |
9 | 457382726708846 |
10 | 106316632513365 |
11 | 3096a6a342633a |
12 | bb10a61148959 |
13 | 474280012b411 |
14 | 1c37a76ac2d81 |
15 | c458161ed610 |
hex | 60b1c51d5b55 |
106316632513365 has 32 divisors (see below), whose sum is σ = 170243501137920. Its totient is φ = 56656585348416.
The previous prime is 106316632513297. The next prime is 106316632513373. The reversal of 106316632513365 is 563315236613601.
It is not a de Polignac number, because 106316632513365 - 210 = 106316632512341 is a prime.
It is a super-2 number, since 2×1063166325133652 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 155530396 + ... + 156212474.
It is an arithmetic number, because the mean of its divisors is an integer number (5320109410560).
Almost surely, 2106316632513365 is an apocalyptic number.
106316632513365 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
106316632513365 is a deficient number, since it is larger than the sum of its proper divisors (63926868624555).
106316632513365 is a wasteful number, since it uses less digits than its factorization.
106316632513365 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 690433.
The product of its (nonzero) digits is 5248800, while the sum is 51.
The spelling of 106316632513365 in words is "one hundred six trillion, three hundred sixteen billion, six hundred thirty-two million, five hundred thirteen thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •