Base | Representation |
---|---|
bin | 1100111100010010111101… |
… | …1010011111001011010001 |
3 | 1212101101011201010120101101 |
4 | 3033010233122133023101 |
5 | 3331121041130433431 |
6 | 50133103143304401 |
7 | 2666041133220430 |
oct | 317045732371321 |
9 | 55341151116341 |
10 | 14230022124241 |
11 | 4596a11571110 |
12 | 1719a5974b101 |
13 | 7c2b680b3481 |
14 | 372a458b7117 |
15 | 19a24edbb961 |
hex | cf12f69f2d1 |
14230022124241 has 8 divisors (see below), whose sum is σ = 17741326284864. Its totient is φ = 11088328927920.
The previous prime is 14230022124217. The next prime is 14230022124287. The reversal of 14230022124241 is 14242122003241.
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 14230022124241 - 29 = 14230022123729 is a prime.
It is not an unprimeable number, because it can be changed into a prime (14230022124211) 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, 92402740990 + ... + 92402741143.
It is an arithmetic number, because the mean of its divisors is an integer number (2217665785608).
Almost surely, 214230022124241 is an apocalyptic number.
14230022124241 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
14230022124241 is a deficient number, since it is larger than the sum of its proper divisors (3511304160623).
14230022124241 is a wasteful number, since it uses less digits than its factorization.
14230022124241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184805482151.
The product of its (nonzero) digits is 6144, while the sum is 28.
Adding to 14230022124241 its reverse (14242122003241), we get a palindrome (28472144127482).
The spelling of 14230022124241 in words is "fourteen trillion, two hundred thirty billion, twenty-two million, one hundred twenty-four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •