Base | Representation |
---|---|
bin | 110101001100101010… |
… | …0011010000000001011 |
3 | 101220212200101002101022 |
4 | 1222121110122000023 |
5 | 3332431300210011 |
6 | 124252021543055 |
7 | 11153002663256 |
oct | 1523124320013 |
9 | 356780332338 |
10 | 114241413131 |
11 | 444a433261a |
12 | 1a183274a8b |
13 | aa08145711 |
14 | 575a61a09d |
15 | 2e896578db |
hex | 1a9951a00b |
114241413131 has 8 divisors (see below), whose sum is σ = 115598627760. Its totient is φ = 112889819232.
The previous prime is 114241413127. The next prime is 114241413163. The reversal of 114241413131 is 131314142411.
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 114241413131 - 22 = 114241413127 is a prime.
It is a super-2 number, since 2×1142414131312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 114241413131.
It is not an unprimeable number, because it can be changed into a prime (114241413101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1364285 + ... + 1445598.
It is an arithmetic number, because the mean of its divisors is an integer number (14449828470).
Almost surely, 2114241413131 is an apocalyptic number.
114241413131 is a deficient number, since it is larger than the sum of its proper divisors (1357214629).
114241413131 is a wasteful number, since it uses less digits than its factorization.
114241413131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2810365.
The product of its digits is 1152, while the sum is 26.
Adding to 114241413131 its reverse (131314142411), we get a palindrome (245555555542).
The spelling of 114241413131 in words is "one hundred fourteen billion, two hundred forty-one million, four hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •