Base | Representation |
---|---|
bin | 11011000000111010… |
… | …11010110000100001 |
3 | 1101102202101020102101 |
4 | 31200131122300201 |
5 | 214200311221101 |
6 | 10355050250401 |
7 | 1022255250616 |
oct | 154035326041 |
9 | 41382336371 |
10 | 14503226401 |
11 | 6172769724 |
12 | 2989126a01 |
13 | 14a1953691 |
14 | 9b826c50d |
15 | 59d3d7401 |
hex | 36075ac21 |
14503226401 has 8 divisors (see below), whose sum is σ = 14669048808. Its totient is φ = 14337840000.
The previous prime is 14503226377. The next prime is 14503226411. The reversal of 14503226401 is 10462230541.
It can be written as a sum of positive squares in 4 ways, for example, as 7348604176 + 7154622225 = 85724^2 + 84585^2 .
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 14503226401 - 27 = 14503226273 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 14503226401.
It is not an unprimeable number, because it can be changed into a prime (14503226411) 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, 41860 + ... + 175381.
It is an arithmetic number, because the mean of its divisors is an integer number (1833631101).
Almost surely, 214503226401 is an apocalyptic number.
It is an amenable number.
14503226401 is a deficient number, since it is larger than the sum of its proper divisors (165822407).
14503226401 is a wasteful number, since it uses less digits than its factorization.
14503226401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218003.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 14503226401 its reverse (10462230541), we get a palindrome (24965456942).
The spelling of 14503226401 in words is "fourteen billion, five hundred three million, two hundred twenty-six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •