Base | Representation |
---|---|
bin | 1100110000010100110000… |
… | …0000011011110111100001 |
3 | 1211122201021121100000012010 |
4 | 3030011030000123313201 |
5 | 3314233323402412001 |
6 | 45454405554423133 |
7 | 2645140206023640 |
oct | 314051400336741 |
9 | 54581247300163 |
10 | 14024343404001 |
11 | 4517766268397 |
12 | 16a6018291aa9 |
13 | 7a964a437108 |
14 | 366ad3539357 |
15 | 194c131238d6 |
hex | cc14c01bde1 |
14024343404001 has 16 divisors (see below), whose sum is σ = 21373533077504. Its totient is φ = 8012746129104.
The previous prime is 14024343403997. The next prime is 14024343404033. The reversal of 14024343404001 is 10040434342041.
It is not a de Polignac number, because 14024343404001 - 22 = 14024343403997 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 14024343404001.
It is not an unprimeable number, because it can be changed into a prime (14024343404041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 48368161 + ... + 48657246.
It is an arithmetic number, because the mean of its divisors is an integer number (1335845817344).
Almost surely, 214024343404001 is an apocalyptic number.
It is an amenable number.
14024343404001 is a deficient number, since it is larger than the sum of its proper divisors (7349189673503).
14024343404001 is an equidigital number, since it uses as much as digits as its factorization.
14024343404001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97032300.
The product of its (nonzero) digits is 18432, while the sum is 30.
Adding to 14024343404001 its reverse (10040434342041), we get a palindrome (24064777746042).
The spelling of 14024343404001 in words is "fourteen trillion, twenty-four billion, three hundred forty-three million, four hundred four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •