Base | Representation |
---|---|
bin | 110001110101011100… |
… | …0100100101101000111 |
3 | 101020020101211220222120 |
4 | 1203222320210231013 |
5 | 3223134044222210 |
6 | 121055252101023 |
7 | 10506024155145 |
oct | 1435270445507 |
9 | 336211756876 |
10 | 107019914055 |
11 | 41428a5146a |
12 | 188a8904773 |
13 | a126c98942 |
14 | 52734c2595 |
15 | 2bb5689270 |
hex | 18eae24b47 |
107019914055 has 8 divisors (see below), whose sum is σ = 171231862512. Its totient is φ = 57077287488.
The previous prime is 107019914047. The next prime is 107019914119. The reversal of 107019914055 is 550419910701.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 107019914055 - 23 = 107019914047 is a prime.
It is a super-2 number, since 2×1070199140552 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 107019913998 and 107019914016.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3567330454 + ... + 3567330483.
It is an arithmetic number, because the mean of its divisors is an integer number (21403982814).
Almost surely, 2107019914055 is an apocalyptic number.
107019914055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
107019914055 is a deficient number, since it is larger than the sum of its proper divisors (64211948457).
107019914055 is an equidigital number, since it uses as much as digits as its factorization.
107019914055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7134660945.
The product of its (nonzero) digits is 56700, while the sum is 42.
The spelling of 107019914055 in words is "one hundred seven billion, nineteen million, nine hundred fourteen thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •