Base | Representation |
---|---|
bin | 11001111011010111110000… |
… | …000100101110111111110101 |
3 | 112221202021020102200120210020 |
4 | 121323113300010232333311 |
5 | 104421241210303430141 |
6 | 1042305100521515353 |
7 | 33006322214526006 |
oct | 3173276004567765 |
9 | 487667212616706 |
10 | 114031114514421 |
11 | 333743623a3a95 |
12 | 10957bb1642b59 |
13 | 4b8211b325270 |
14 | 20231c77251ad |
15 | d2b327098266 |
hex | 67b5f012eff5 |
114031114514421 has 32 divisors (see below), whose sum is σ = 169386551429760. Its totient is φ = 67751849727744.
The previous prime is 114031114514357. The next prime is 114031114514501. The reversal of 114031114514421 is 124415411130411.
It is a happy number.
It is not a de Polignac number, because 114031114514421 - 26 = 114031114514357 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114031114514221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 55683355 + ... + 57694871.
It is an arithmetic number, because the mean of its divisors is an integer number (5293329732180).
Almost surely, 2114031114514421 is an apocalyptic number.
It is an amenable number.
114031114514421 is a deficient number, since it is larger than the sum of its proper divisors (55355436915339).
114031114514421 is a wasteful number, since it uses less digits than its factorization.
114031114514421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2061685.
The product of its (nonzero) digits is 7680, while the sum is 33.
Adding to 114031114514421 its reverse (124415411130411), we get a palindrome (238446525644832).
The spelling of 114031114514421 in words is "one hundred fourteen trillion, thirty-one billion, one hundred fourteen million, five hundred fourteen thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •