Base | Representation |
---|---|
bin | 1101000110010000000100… |
… | …1001001100110100011001 |
3 | 1212222201121112222001222102 |
4 | 3101210001021030310121 |
5 | 3341421314400020010 |
6 | 50343425403133145 |
7 | 3014304210545621 |
oct | 321440111146431 |
9 | 55881545861872 |
10 | 14401044532505 |
11 | 46524a3227794 |
12 | 17470288141b5 |
13 | 806021ac2057 |
14 | 37b02b251881 |
15 | 19e90e372ba5 |
hex | d190124cd19 |
14401044532505 has 8 divisors (see below), whose sum is σ = 17449032599232. Its totient is φ = 11408982852528.
The previous prime is 14401044532417. The next prime is 14401044532507. The reversal of 14401044532505 is 50523544010441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14401044532505 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14401044532507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13981596119 + ... + 13981597148.
It is an arithmetic number, because the mean of its divisors is an integer number (2181129074904).
Almost surely, 214401044532505 is an apocalyptic number.
It is an amenable number.
14401044532505 is a deficient number, since it is larger than the sum of its proper divisors (3047988066727).
14401044532505 is a wasteful number, since it uses less digits than its factorization.
14401044532505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27963193375.
The product of its (nonzero) digits is 192000, while the sum is 38.
Adding to 14401044532505 its reverse (50523544010441), we get a palindrome (64924588542946).
The spelling of 14401044532505 in words is "fourteen trillion, four hundred one billion, forty-four million, five hundred thirty-two thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •