Base | Representation |
---|---|
bin | 1101000110011001010010… |
… | …1101010010010100111001 |
3 | 1212222222000002110012022202 |
4 | 3101212110231102110321 |
5 | 3341441402140234001 |
6 | 50344515202155545 |
7 | 3014422442001521 |
oct | 321462455222471 |
9 | 55888002405282 |
10 | 14403520243001 |
11 | 465355375071a |
12 | 17475b9952bb5 |
13 | 8063279987c6 |
14 | 37b1c3d7c681 |
15 | 19ea068a196b |
hex | d1994b52539 |
14403520243001 has 8 divisors (see below), whose sum is σ = 14437257778944. Its totient is φ = 14369784183360.
The previous prime is 14403520242971. The next prime is 14403520243009. The reversal of 14403520243001 is 10034202530441.
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 14403520243001 - 214 = 14403520226617 is a prime.
It is a super-2 number, since 2×144035202430012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14403520243009) 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, 20553281 + ... + 21242513.
It is an arithmetic number, because the mean of its divisors is an integer number (1804657222368).
Almost surely, 214403520243001 is an apocalyptic number.
It is an amenable number.
14403520243001 is a deficient number, since it is larger than the sum of its proper divisors (33737535943).
14403520243001 is an equidigital number, since it uses as much as digits as its factorization.
14403520243001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 738151.
The product of its (nonzero) digits is 11520, while the sum is 29.
Adding to 14403520243001 its reverse (10034202530441), we get a palindrome (24437722773442).
The spelling of 14403520243001 in words is "fourteen trillion, four hundred three billion, five hundred twenty million, two hundred forty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.228 sec. • engine limits •