Base | Representation |
---|---|
bin | 1101000110010000011101… |
… | …1101100011111011011101 |
3 | 1212222201212221102110210022 |
4 | 3101210013131203323131 |
5 | 3341422024014031331 |
6 | 50343444111121525 |
7 | 3014306635543145 |
oct | 321440735437335 |
9 | 55881787373708 |
10 | 14401150533341 |
11 | 4652548047790 |
12 | 17470582132a5 |
13 | 80603aa57040 |
14 | 37b03b365925 |
15 | 19e91881067b |
hex | d1907763edd |
14401150533341 has 16 divisors (see below), whose sum is σ = 17464603043328. Its totient is φ = 11695046673600.
The previous prime is 14401150533323. The next prime is 14401150533349. The reversal of 14401150533341 is 14333505110441.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 14401150533341 - 230 = 14400076791517 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 (14401150533349) 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, 1624307606 + ... + 1624316471.
It is an arithmetic number, because the mean of its divisors is an integer number (1091537690208).
Almost surely, 214401150533341 is an apocalyptic number.
14401150533341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
14401150533341 is a deficient number, since it is larger than the sum of its proper divisors (3063452509987).
14401150533341 is a wasteful number, since it uses less digits than its factorization.
14401150533341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3248624132.
The product of its (nonzero) digits is 43200, while the sum is 35.
Adding to 14401150533341 its reverse (14333505110441), we get a palindrome (28734655643782).
The spelling of 14401150533341 in words is "fourteen trillion, four hundred one billion, one hundred fifty million, five hundred thirty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •