Base | Representation |
---|---|
bin | 110001011001011101… |
… | …1010101101111111100 |
3 | 101010210222022222222002 |
4 | 1202302323111233330 |
5 | 3214223231141012 |
6 | 120422154241432 |
7 | 10443534413066 |
oct | 1426273255774 |
9 | 333728288862 |
10 | 106081115132 |
11 | 40a97029993 |
12 | 18686426278 |
13 | a007639315 |
14 | 51c4946736 |
15 | 2b5d0467c2 |
hex | 18b2ed5bfc |
106081115132 has 12 divisors (see below), whose sum is σ = 196562066400. Its totient is φ = 49920524736.
The previous prime is 106081115099. The next prime is 106081115207. The reversal of 106081115132 is 231511180601.
It is a super-2 number, since 2×1060811151322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106081115095 and 106081115104.
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 3 ways as a sum of consecutive naturals, for example, 780008132 + ... + 780008267.
It is an arithmetic number, because the mean of its divisors is an integer number (16380172200).
Almost surely, 2106081115132 is an apocalyptic number.
It is an amenable number.
106081115132 is a deficient number, since it is larger than the sum of its proper divisors (90480951268).
106081115132 is a wasteful number, since it uses less digits than its factorization.
106081115132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1560016420 (or 1560016418 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 29.
Adding to 106081115132 its reverse (231511180601), we get a palindrome (337592295733).
The spelling of 106081115132 in words is "one hundred six billion, eighty-one million, one hundred fifteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •