Base | Representation |
---|---|
bin | 11001111011001000110000… |
… | …110001000101101101101001 |
3 | 112221200201200210001021101101 |
4 | 121323020300301011231221 |
5 | 104421010230110430231 |
6 | 1042253435504521401 |
7 | 33005212324531360 |
oct | 3173106061055551 |
9 | 487621623037341 |
10 | 114015020014441 |
11 | 33368553483a37 |
12 | 10954a5b620261 |
13 | 4b80754b02ab0 |
14 | 20224dbdd47d7 |
15 | d2abd4137661 |
hex | 67b230c45b69 |
114015020014441 has 8 divisors (see below), whose sum is σ = 140326178479424. Its totient is φ = 90209686165200.
The previous prime is 114015020014433. The next prime is 114015020014457. The reversal of 114015020014441 is 144410020510411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114015020014441 - 23 = 114015020014433 is a prime.
It is not an unprimeable number, because it can be changed into a prime (114015020014241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 626456153835 + ... + 626456154016.
It is an arithmetic number, because the mean of its divisors is an integer number (17540772309928).
Almost surely, 2114015020014441 is an apocalyptic number.
It is an amenable number.
114015020014441 is a deficient number, since it is larger than the sum of its proper divisors (26311158464983).
114015020014441 is a wasteful number, since it uses less digits than its factorization.
114015020014441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1252912307871.
The product of its (nonzero) digits is 2560, while the sum is 28.
Adding to 114015020014441 its reverse (144410020510411), we get a palindrome (258425040524852).
The spelling of 114015020014441 in words is "one hundred fourteen trillion, fifteen billion, twenty million, fourteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •