Base | Representation |
---|---|
bin | 110001101101100001… |
… | …0010001001001101110 |
3 | 101012112212112002211202 |
4 | 1203123002101021232 |
5 | 3222113012114300 |
6 | 121013033045502 |
7 | 10466315124524 |
oct | 1433302211156 |
9 | 335485462752 |
10 | 106754019950 |
11 | 41301952276 |
12 | 18833856892 |
13 | a0b3b7c956 |
14 | 524a06a314 |
15 | 2b9c165ad5 |
hex | 18db09126e |
106754019950 has 12 divisors (see below), whose sum is σ = 198562477200. Its totient is φ = 42701607960.
The previous prime is 106754019937. The next prime is 106754019991. The reversal of 106754019950 is 59910457601.
It is a super-2 number, since 2×1067540199502 (a number of 23 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (47) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 106754019895 and 106754019904.
It is a congruent number.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 1067540150 + ... + 1067540249.
It is an arithmetic number, because the mean of its divisors is an integer number (16546873100).
Almost surely, 2106754019950 is an apocalyptic number.
106754019950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106754019950 is a deficient number, since it is larger than the sum of its proper divisors (91808457250).
106754019950 is a wasteful number, since it uses less digits than its factorization.
106754019950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2135080411 (or 2135080406 counting only the distinct ones).
The product of its (nonzero) digits is 340200, while the sum is 47.
The spelling of 106754019950 in words is "one hundred six billion, seven hundred fifty-four million, nineteen thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •