Base | Representation |
---|---|
bin | 11001111110011110001101… |
… | …100011101000110101010011 |
3 | 112222111122021102111200210021 |
4 | 121332132031203220311103 |
5 | 104433234120232123201 |
6 | 1042551022054244311 |
7 | 33030605011551244 |
oct | 3176361543506523 |
9 | 488448242450707 |
10 | 114244210036051 |
11 | 33446774252437 |
12 | 10991362956697 |
13 | 4b9924b74c3b4 |
14 | 202d640b18ccb |
15 | d31b4a03bea1 |
hex | 67e78d8e8d53 |
114244210036051 has 2 divisors, whose sum is σ = 114244210036052. Its totient is φ = 114244210036050.
The previous prime is 114244210036037. The next prime is 114244210036069. The reversal of 114244210036051 is 150630012442411.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 114244210036051 - 215 = 114244210003283 is a prime.
It is a super-2 number, since 2×1142442100360512 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 114244210035998 and 114244210036016.
It is not a weakly prime, because it can be changed into another prime (114244210034051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57122105018025 + 57122105018026.
It is an arithmetic number, because the mean of its divisors is an integer number (57122105018026).
Almost surely, 2114244210036051 is an apocalyptic number.
114244210036051 is a deficient number, since it is larger than the sum of its proper divisors (1).
114244210036051 is an equidigital number, since it uses as much as digits as its factorization.
114244210036051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23040, while the sum is 34.
Adding to 114244210036051 its reverse (150630012442411), we get a palindrome (264874222478462).
The spelling of 114244210036051 in words is "one hundred fourteen trillion, two hundred forty-four billion, two hundred ten million, thirty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •