Base | Representation |
---|---|
bin | 1101000110011000111001… |
… | …1000011001000011011000 |
3 | 1212222221201200201200120011 |
4 | 3101212032120121003120 |
5 | 3341441143002232412 |
6 | 50344500451211304 |
7 | 3014420012552311 |
oct | 321461630310330 |
9 | 55887650650504 |
10 | 14403414102232 |
11 | 46534a9845581 |
12 | 174758a2a6b34 |
13 | 80630b9b4c0c |
14 | 37b1b3c2d608 |
15 | 19e9ec3d77a7 |
hex | d198e6190d8 |
14403414102232 has 16 divisors (see below), whose sum is σ = 27074427647760. Its totient is φ = 7183566729504.
The previous prime is 14403414102223. The next prime is 14403414102239. The reversal of 14403414102232 is 23220141430441.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 14403414102194 and 14403414102203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14403414102239) 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 3 ways as a sum of consecutive naturals, for example, 2267536828 + ... + 2267543179.
It is an arithmetic number, because the mean of its divisors is an integer number (1692151727985).
Almost surely, 214403414102232 is an apocalyptic number.
It is an amenable number.
14403414102232 is a deficient number, since it is larger than the sum of its proper divisors (12671013545528).
14403414102232 is a wasteful number, since it uses less digits than its factorization.
14403414102232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4535080410 (or 4535080406 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 14403414102232 its reverse (23220141430441), we get a palindrome (37623555532673).
The spelling of 14403414102232 in words is "fourteen trillion, four hundred three billion, four hundred fourteen million, one hundred two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •