Base | Representation |
---|---|
bin | 110000111100101001… |
… | …0001011011010000011 |
3 | 101001022120120122201112 |
4 | 1201321102023122003 |
5 | 3210233142223210 |
6 | 120142210153535 |
7 | 10410552313112 |
oct | 1417122133203 |
9 | 331276518645 |
10 | 105114023555 |
11 | 40640142752 |
12 | 184565828ab |
13 | 9bb2181b98 |
14 | 5132323c79 |
15 | 2b031b5d05 |
hex | 187948b683 |
105114023555 has 16 divisors (see below), whose sum is σ = 127933344000. Its totient is φ = 82893911520.
The previous prime is 105114023491. The next prime is 105114023561. The reversal of 105114023555 is 555320411501.
It is not a de Polignac number, because 105114023555 - 26 = 105114023491 is a prime.
It is a super-2 number, since 2×1051140235552 (a number of 23 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 2713916 + ... + 2752374.
It is an arithmetic number, because the mean of its divisors is an integer number (7995834000).
Almost surely, 2105114023555 is an apocalyptic number.
105114023555 is a deficient number, since it is larger than the sum of its proper divisors (22819320445).
105114023555 is an equidigital number, since it uses as much as digits as its factorization.
105114023555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46234.
The product of its (nonzero) digits is 15000, while the sum is 32.
The spelling of 105114023555 in words is "one hundred five billion, one hundred fourteen million, twenty-three thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •