Base | Representation |
---|---|
bin | 1100111100100110110000… |
… | …0110000000010100100010 |
3 | 1212101212212222111100111012 |
4 | 3033021230012000110202 |
5 | 3331212431243214300 |
6 | 50135342255420522 |
7 | 2666316606103325 |
oct | 317115406002442 |
9 | 55355788440435 |
10 | 14235335132450 |
11 | 4599198627893 |
12 | 171aaa0b24742 |
13 | 7c3503a45a03 |
14 | 372dcb3767bc |
15 | 19a461551435 |
hex | cf26c180522 |
14235335132450 has 48 divisors (see below), whose sum is σ = 28037386133064. Its totient is φ = 5358774067200.
The previous prime is 14235335132437. The next prime is 14235335132489. The reversal of 14235335132450 is 5423153353241.
It can be written as a sum of positive squares in 12 ways, for example, as 4237780436569 + 9997554695881 = 2058587^2 + 3161891^2 .
It is a junction number, because it is equal to n+sod(n) for n = 14235335132398 and 14235335132407.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 10564970 + ... + 11835930.
Almost surely, 214235335132450 is an apocalyptic number.
14235335132450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14235335132450 is a deficient number, since it is larger than the sum of its proper divisors (13802051000614).
14235335132450 is a wasteful number, since it uses less digits than its factorization.
14235335132450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1284167 (or 1284162 counting only the distinct ones).
The product of its (nonzero) digits is 648000, while the sum is 41.
Adding to 14235335132450 its reverse (5423153353241), we get a palindrome (19658488485691).
The spelling of 14235335132450 in words is "fourteen trillion, two hundred thirty-five billion, three hundred thirty-five million, one hundred thirty-two thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •