Base | Representation |
---|---|
bin | 1100110000010011110110… |
… | …0001100100000111011101 |
3 | 1211122200122200010122221012 |
4 | 3030010331201210013131 |
5 | 3314232324202232201 |
6 | 45454325514545005 |
7 | 2645131165544543 |
oct | 314047541440735 |
9 | 54580580118835 |
10 | 14024100430301 |
11 | 45176510a3685 |
12 | 16a5b6aa38165 |
13 | 7a960bcb48b0 |
14 | 366aad16bd93 |
15 | 194bebb2b5bb |
hex | cc13d8641dd |
14024100430301 has 32 divisors (see below), whose sum is σ = 15225446099808. Its totient is φ = 12840642662400.
The previous prime is 14024100430273. The next prime is 14024100430349. The reversal of 14024100430301 is 10303400142041.
It can be written as a sum of positive squares in 16 ways, for example, as 3666478188025 + 10357622242276 = 1914805^2 + 3218326^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14024100430301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14024100430381) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3104735495 + ... + 3104740011.
It is an arithmetic number, because the mean of its divisors is an integer number (475795190619).
Almost surely, 214024100430301 is an apocalyptic number.
It is an amenable number.
14024100430301 is a deficient number, since it is larger than the sum of its proper divisors (1201345669507).
14024100430301 is a wasteful number, since it uses less digits than its factorization.
14024100430301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7601.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 14024100430301 its reverse (10303400142041), we get a palindrome (24327500572342).
The spelling of 14024100430301 in words is "fourteen trillion, twenty-four billion, one hundred million, four hundred thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •