Base | Representation |
---|---|
bin | 110101011010101010… |
… | …0110001101001101001 |
3 | 101222002102111101122011 |
4 | 1222311110301221221 |
5 | 3334412041201131 |
6 | 124410404355521 |
7 | 11200436503312 |
oct | 1526524615151 |
9 | 358072441564 |
10 | 114711272041 |
11 | 44715582573 |
12 | 1a2946a5ba1 |
13 | aa815a6542 |
14 | 57a2ba7609 |
15 | 2eb5a1a0b1 |
hex | 1ab5531a69 |
114711272041 has 8 divisors (see below), whose sum is σ = 116560425600. Its totient is φ = 112876509168.
The previous prime is 114711272021. The next prime is 114711272057. The reversal of 114711272041 is 140272117411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 114711272041 - 25 = 114711272009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 114711271994 and 114711272012.
It is not an unprimeable number, because it can be changed into a prime (114711272021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3581601 + ... + 3613486.
It is an arithmetic number, because the mean of its divisors is an integer number (14570053200).
Almost surely, 2114711272041 is an apocalyptic number.
It is an amenable number.
114711272041 is a deficient number, since it is larger than the sum of its proper divisors (1849153559).
114711272041 is a wasteful number, since it uses less digits than its factorization.
114711272041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7195343.
The product of its (nonzero) digits is 3136, while the sum is 31.
Adding to 114711272041 its reverse (140272117411), we get a palindrome (254983389452).
The spelling of 114711272041 in words is "one hundred fourteen billion, seven hundred eleven million, two hundred seventy-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •