Base | Representation |
---|---|
bin | 110000111001101010… |
… | …1001010000011100011 |
3 | 101001001121122002211101 |
4 | 1201303111022003203 |
5 | 3210032110004110 |
6 | 120124241255231 |
7 | 10405230320560 |
oct | 1416325120343 |
9 | 331047562741 |
10 | 105014141155 |
11 | 40599821610 |
12 | 18429034517 |
13 | 9b9757ca81 |
14 | 5122d63867 |
15 | 2ae953613a |
hex | 187354a0e3 |
105014141155 has 16 divisors (see below), whose sum is σ = 157112066304. Its totient is φ = 65463360480.
The previous prime is 105014141137. The next prime is 105014141189. The reversal of 105014141155 is 551141410501.
It is a de Polignac number, because none of the positive numbers 2k-105014141155 is a prime.
It is a super-2 number, since 2×1050141411552 (a number of 23 digits) contains 22 as substring.
It is a Duffinian 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 15 ways as a sum of consecutive naturals, for example, 136381617 + ... + 136382386.
It is an arithmetic number, because the mean of its divisors is an integer number (9819504144).
Almost surely, 2105014141155 is an apocalyptic number.
105014141155 is a deficient number, since it is larger than the sum of its proper divisors (52097925149).
105014141155 is a wasteful number, since it uses less digits than its factorization.
105014141155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272764026.
The product of its (nonzero) digits is 2000, while the sum is 28.
Adding to 105014141155 its reverse (551141410501), we get a palindrome (656155551656).
The spelling of 105014141155 in words is "one hundred five billion, fourteen million, one hundred forty-one thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •