Base | Representation |
---|---|
bin | 11001111011001000110010… |
… | …110011100000001000111101 |
3 | 112221200201210011101011002020 |
4 | 121323020302303200020331 |
5 | 104421010312333421110 |
6 | 1042253443125350353 |
7 | 33005213221236000 |
oct | 3173106263401075 |
9 | 487621704334066 |
10 | 114015054201405 |
11 | 33368570804125 |
12 | 10954a6ab683b9 |
13 | 4b8075bc12776 |
14 | 2022502773537 |
15 | d2abd713bd70 |
hex | 67b232ce023d |
114015054201405 has 128 divisors (see below), whose sum is σ = 215600486400000. Its totient is φ = 51421246216704.
The previous prime is 114015054201403. The next prime is 114015054201413. The reversal of 114015054201405 is 504102450510411.
It is not a de Polignac number, because 114015054201405 - 21 = 114015054201403 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114015054201401) 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 127 ways as a sum of consecutive naturals, for example, 523811686 + ... + 524029304.
It is an arithmetic number, because the mean of its divisors is an integer number (1684378800000).
Almost surely, 2114015054201405 is an apocalyptic number.
114015054201405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
114015054201405 is a deficient number, since it is larger than the sum of its proper divisors (101585432198595).
114015054201405 is a wasteful number, since it uses less digits than its factorization.
114015054201405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219016 (or 219002 counting only the distinct ones).
The product of its (nonzero) digits is 16000, while the sum is 33.
The spelling of 114015054201405 in words is "one hundred fourteen trillion, fifteen billion, fifty-four million, two hundred one thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •