Base | Representation |
---|---|
bin | 1101000110011000111001… |
… | …1100010101001110011110 |
3 | 1212222221201202200011102210 |
4 | 3101212032130111032132 |
5 | 3341441143233311014 |
6 | 50344500525301250 |
7 | 3014420024413554 |
oct | 321461634251636 |
9 | 55887652604383 |
10 | 14403415135134 |
11 | 46534aa390613 |
12 | 174758a704826 |
13 | 80630bc870bc |
14 | 37b1b401bbd4 |
15 | 19e9ec53d859 |
hex | d198e71539e |
14403415135134 has 32 divisors (see below), whose sum is σ = 30792454850304. Its totient is φ = 4480383638720.
The previous prime is 14403415135133. The next prime is 14403415135141. The reversal of 14403415135134 is 43153151430441.
It is a junction number, because it is equal to n+sod(n) for n = 14403415135092 and 14403415135101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14403415135133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1272830604 + ... + 1272841919.
It is an arithmetic number, because the mean of its divisors is an integer number (962264214072).
Almost surely, 214403415135134 is an apocalyptic number.
14403415135134 is an abundant number, since it is smaller than the sum of its proper divisors (16389039715170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14403415135134 is a wasteful number, since it uses less digits than its factorization.
14403415135134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2545672592.
The product of its (nonzero) digits is 172800, while the sum is 39.
Adding to 14403415135134 its reverse (43153151430441), we get a palindrome (57556566565575).
The spelling of 14403415135134 in words is "fourteen trillion, four hundred three billion, four hundred fifteen million, one hundred thirty-five thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •