Base | Representation |
---|---|
bin | 1100001001010101001011… |
… | …0001100100101110010101 |
3 | 1202021200011000202021022121 |
4 | 3002111102301210232111 |
5 | 3222244344131103303 |
6 | 44222540155455541 |
7 | 2545553344333150 |
oct | 302252261445625 |
9 | 52250130667277 |
10 | 13354442050453 |
11 | 428965042a319 |
12 | 15b821b7575b1 |
13 | 75b41a92095a |
14 | 3425037dac97 |
15 | 1825a667d9bd |
hex | c2552c64b95 |
13354442050453 has 8 divisors (see below), whose sum is σ = 15262307375040. Its totient is φ = 11446598698080.
The previous prime is 13354442050447. The next prime is 13354442050487. The reversal of 13354442050453 is 35405024445331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13354442050453 - 225 = 13354408496021 is a prime.
It is a super-2 number, since 2×133544420504532 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13354442020453) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4169383 + ... + 6640228.
It is an arithmetic number, because the mean of its divisors is an integer number (1907788421880).
Almost surely, 213354442050453 is an apocalyptic number.
It is an amenable number.
13354442050453 is a deficient number, since it is larger than the sum of its proper divisors (1907865324587).
13354442050453 is a wasteful number, since it uses less digits than its factorization.
13354442050453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10986107.
The product of its (nonzero) digits is 1728000, while the sum is 43.
Adding to 13354442050453 its reverse (35405024445331), we get a palindrome (48759466495784).
The spelling of 13354442050453 in words is "thirteen trillion, three hundred fifty-four billion, four hundred forty-two million, fifty thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •