Base | Representation |
---|---|
bin | 1101000000100011100100… |
… | …1110001111111101110011 |
3 | 1212122101001200100100122000 |
4 | 3100020321032033331303 |
5 | 3333320423442214103 |
6 | 50230444435345043 |
7 | 3004241441430441 |
oct | 320107116177563 |
9 | 55571050310560 |
10 | 14303201132403 |
11 | 4614a54179057 |
12 | 1730081152183 |
13 | 7c9a2b029931 |
14 | 3763c87b1b91 |
15 | 19c0d4630aa3 |
hex | d023938ff73 |
14303201132403 has 16 divisors (see below), whose sum is σ = 21640777128960. Its totient is φ = 9332585135208.
The previous prime is 14303201132393. The next prime is 14303201132431. The reversal of 14303201132403 is 30423110230341.
It is a happy number.
14303201132403 is a `hidden beast` number, since 1 + 4 + 3 + 0 + 320 + 11 + 324 + 0 + 3 = 666.
It is not a de Polignac number, because 14303201132403 - 25 = 14303201132371 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (14303201132443) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5635617775 + ... + 5635620312.
It is an arithmetic number, because the mean of its divisors is an integer number (1352548570560).
Almost surely, 214303201132403 is an apocalyptic number.
14303201132403 is a deficient number, since it is larger than the sum of its proper divisors (7337575996557).
14303201132403 is a wasteful number, since it uses less digits than its factorization.
14303201132403 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11271238143 (or 11271238137 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 14303201132403 its reverse (30423110230341), we get a palindrome (44726311362744).
The spelling of 14303201132403 in words is "fourteen trillion, three hundred three billion, two hundred one million, one hundred thirty-two thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •