Base | Representation |
---|---|
bin | 1100110111110000011011… |
… | …1010101111011110110101 |
3 | 1212002220212112101221020100 |
4 | 3031330012322233132311 |
5 | 3323331331011134303 |
6 | 50033204312224313 |
7 | 2660310402165234 |
oct | 315740672573665 |
9 | 55086775357210 |
10 | 14152033302453 |
11 | 4566930946a92 |
12 | 170691339b099 |
13 | 7b86b983a947 |
14 | 36cd67ca6b1b |
15 | 1981d826c8a3 |
hex | cdf06eaf7b5 |
14152033302453 has 24 divisors (see below), whose sum is σ = 20495749249976. Its totient is φ = 9409806806400.
The previous prime is 14152033302439. The next prime is 14152033302541. The reversal of 14152033302453 is 35420333025141.
14152033302453 is a `hidden beast` number, since 1 + 4 + 1 + 520 + 33 + 30 + 24 + 53 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 778845080484 + 13373188221969 = 882522^2 + 3656937^2 .
It is not a de Polignac number, because 14152033302453 - 210 = 14152033301429 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 (14152033302053) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 30429123 + ... + 30890703.
Almost surely, 214152033302453 is an apocalyptic number.
It is an amenable number.
14152033302453 is a deficient number, since it is larger than the sum of its proper divisors (6343715947523).
14152033302453 is a wasteful number, since it uses less digits than its factorization.
14152033302453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 470565 (or 470562 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 36.
Adding to 14152033302453 its reverse (35420333025141), we get a palindrome (49572366327594).
The spelling of 14152033302453 in words is "fourteen trillion, one hundred fifty-two billion, thirty-three million, three hundred two thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •