Base | Representation |
---|---|
bin | 1101000010001000001111… |
… | …1011001110011001001001 |
3 | 1212201221210222002110121101 |
4 | 3100202003323032121021 |
5 | 3334241244401141301 |
6 | 50251114130341401 |
7 | 3006216213155332 |
oct | 320420373163111 |
9 | 55657728073541 |
10 | 14330224240201 |
11 | 4625460aa49a1 |
12 | 173536312a861 |
13 | 7cc44673b34c |
14 | 37782d70b289 |
15 | 19cb66c2c701 |
hex | d0883ece649 |
14330224240201 has 8 divisors (see below), whose sum is σ = 14792583809024. Its totient is φ = 13867870563360.
The previous prime is 14330224240177. The next prime is 14330224240261. The reversal of 14330224240201 is 10204242203341.
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 14330224240201 - 25 = 14330224240169 is a prime.
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 14330224240201.
It is not an unprimeable number, because it can be changed into a prime (14330224240261) 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, 3765565 + ... + 6545221.
It is an arithmetic number, because the mean of its divisors is an integer number (1849072976128).
Almost surely, 214330224240201 is an apocalyptic number.
It is an amenable number.
14330224240201 is a deficient number, since it is larger than the sum of its proper divisors (462359568823).
14330224240201 is a wasteful number, since it uses less digits than its factorization.
14330224240201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2945991.
The product of its (nonzero) digits is 9216, while the sum is 28.
Adding to 14330224240201 its reverse (10204242203341), we get a palindrome (24534466443542).
The spelling of 14330224240201 in words is "fourteen trillion, three hundred thirty billion, two hundred twenty-four million, two hundred forty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •