Base | Representation |
---|---|
bin | 110101000101110110… |
… | …1001010111100101001 |
3 | 101220021202121201110010 |
4 | 1222023231022330221 |
5 | 3331444313232131 |
6 | 124213222442133 |
7 | 11144230500000 |
oct | 1521355127451 |
9 | 356252551403 |
10 | 114013024041 |
11 | 4439741a504 |
12 | 1a11a893349 |
13 | a99ca2b747 |
14 | 5738167c37 |
15 | 2e74591b46 |
hex | 1a8bb4af29 |
114013024041 has 48 divisors (see below), whose sum is σ = 187785972864. Its totient is φ = 61317467904.
The previous prime is 114013024039. The next prime is 114013024043. The reversal of 114013024041 is 140420310411.
It is an interprime number because it is at equal distance from previous prime (114013024039) and next prime (114013024043).
It is not a de Polignac number, because 114013024041 - 21 = 114013024039 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 114013023999 and 114013024017.
It is not an unprimeable number, because it can be changed into a prime (114013024043) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 790651 + ... + 923663.
It is an arithmetic number, because the mean of its divisors is an integer number (3912207768).
Almost surely, 2114013024041 is an apocalyptic number.
It is an amenable number.
114013024041 is a deficient number, since it is larger than the sum of its proper divisors (73772948823).
114013024041 is an frugal number, since it uses more digits than its factorization.
114013024041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 133068 (or 133040 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 114013024041 its reverse (140420310411), we get a palindrome (254433334452).
The spelling of 114013024041 in words is "one hundred fourteen billion, thirteen million, twenty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •