Base | Representation |
---|---|
bin | 110101011110100000… |
… | …0001100100011100101 |
3 | 101222102101220021102222 |
4 | 1222331000030203211 |
5 | 3340143031014244 |
6 | 124431245442125 |
7 | 11203562462306 |
oct | 1527500144345 |
9 | 358371807388 |
10 | 114840094949 |
11 | 44781270088 |
12 | 1a30b870345 |
13 | aaa219c308 |
14 | 57b5d3c7ad |
15 | 2ec1eb4bee |
hex | 1abd00c8e5 |
114840094949 has 2 divisors, whose sum is σ = 114840094950. Its totient is φ = 114840094948.
The previous prime is 114840094931. The next prime is 114840094979. The reversal of 114840094949 is 949490048411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 113064062500 + 1776032449 = 336250^2 + 42143^2 .
It is an emirp because it is prime and its reverse (949490048411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 114840094949 - 228 = 114571659493 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 114840094949.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114840094979) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57420047474 + 57420047475.
It is an arithmetic number, because the mean of its divisors is an integer number (57420047475).
Almost surely, 2114840094949 is an apocalyptic number.
It is an amenable number.
114840094949 is a deficient number, since it is larger than the sum of its proper divisors (1).
114840094949 is an equidigital number, since it uses as much as digits as its factorization.
114840094949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1492992, while the sum is 53.
The spelling of 114840094949 in words is "one hundred fourteen billion, eight hundred forty million, ninety-four thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •