Base | Representation |
---|---|
bin | 110001011101111100… |
… | …0100000011110000001 |
3 | 101011012110001121112120 |
4 | 1202323320200132001 |
5 | 3220030212230203 |
6 | 120445122514453 |
7 | 10450340503563 |
oct | 1427370403601 |
9 | 334173047476 |
10 | 106231367553 |
11 | 41063923843 |
12 | 18708805a29 |
13 | a02c7c608c |
14 | 51da899333 |
15 | 2b6b325b53 |
hex | 18bbe20781 |
106231367553 has 16 divisors (see below), whose sum is σ = 147861697536. Its totient is φ = 67713538640.
The previous prime is 106231367537. The next prime is 106231367581. The reversal of 106231367553 is 355763132601.
It is a cyclic number.
It is not a de Polignac number, because 106231367553 - 24 = 106231367537 is a prime.
It is a super-2 number, since 2×1062313675532 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106231367953) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 152925 + ... + 485642.
It is an arithmetic number, because the mean of its divisors is an integer number (9241356096).
Almost surely, 2106231367553 is an apocalyptic number.
It is an amenable number.
106231367553 is a deficient number, since it is larger than the sum of its proper divisors (41630329983).
106231367553 is a wasteful number, since it uses less digits than its factorization.
106231367553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 641004.
The product of its (nonzero) digits is 340200, while the sum is 42.
The spelling of 106231367553 in words is "one hundred six billion, two hundred thirty-one million, three hundred sixty-seven thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •