Base | Representation |
---|---|
bin | 11001111011101011010011… |
… | …001101011110111001110111 |
3 | 112221211021102022012001212111 |
4 | 121323223103031132321313 |
5 | 104422112202401330030 |
6 | 1042322451435031451 |
7 | 33010664325564100 |
oct | 3173532315367167 |
9 | 487737368161774 |
10 | 114052105105015 |
11 | 33382253aaa420 |
12 | 1096008b29b587 |
13 | 4b840b4cc427c |
14 | 20242193c93a7 |
15 | d2bb54c8762a |
hex | 67bad335ee77 |
114052105105015 has 48 divisors (see below), whose sum is σ = 173687160276864. Its totient is φ = 71094825211200.
The previous prime is 114052105105013. The next prime is 114052105105039. The reversal of 114052105105015 is 510501501250411.
It is not a de Polignac number, because 114052105105015 - 21 = 114052105105013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114052105105013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 74560020 + ... + 76074310.
It is an arithmetic number, because the mean of its divisors is an integer number (3618482505768).
Almost surely, 2114052105105015 is an apocalyptic number.
114052105105015 is a deficient number, since it is larger than the sum of its proper divisors (59635055171849).
114052105105015 is a wasteful number, since it uses less digits than its factorization.
114052105105015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1542268 (or 1542261 counting only the distinct ones).
The product of its (nonzero) digits is 5000, while the sum is 31.
Adding to 114052105105015 its reverse (510501501250411), we get a palindrome (624553606355426).
The spelling of 114052105105015 in words is "one hundred fourteen trillion, fifty-two billion, one hundred five million, one hundred five thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •