Base | Representation |
---|---|
bin | 110001011000000010… |
… | …0011000011001101000 |
3 | 101010200122002022011112 |
4 | 1202300010120121220 |
5 | 3214123441404030 |
6 | 120413322245452 |
7 | 10442412635501 |
oct | 1426004303150 |
9 | 333618068145 |
10 | 106033153640 |
11 | 40a71a50797 |
12 | 18672356888 |
13 | 9cca715a3b |
14 | 51bc41dba8 |
15 | 2b58c20a95 |
hex | 18b0118668 |
106033153640 has 16 divisors (see below), whose sum is σ = 238574595780. Its totient is φ = 42413261440.
The previous prime is 106033153631. The next prime is 106033153657. The reversal of 106033153640 is 46351330601.
It can be written as a sum of positive squares in 2 ways, for example, as 94296898084 + 11736255556 = 307078^2 + 108334^2 .
It is a super-2 number, since 2×1060331536402 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106033153597 and 106033153606.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1325414381 + ... + 1325414460.
Almost surely, 2106033153640 is an apocalyptic number.
106033153640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106033153640 is an abundant number, since it is smaller than the sum of its proper divisors (132541442140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106033153640 is a wasteful number, since it uses less digits than its factorization.
106033153640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2650828852 (or 2650828848 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 32.
The spelling of 106033153640 in words is "one hundred six billion, thirty-three million, one hundred fifty-three thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •