Base | Representation |
---|---|
bin | 1010011010101100000101… |
… | …0100010100100101101001 |
3 | 1111112221210220021021021211 |
4 | 2212223001110110211221 |
5 | 3000124011243003113 |
6 | 40205420114033121 |
7 | 2261332350565666 |
oct | 246530124244551 |
9 | 44487726237254 |
10 | 11453626141033 |
11 | 37165013a782a |
12 | 134b9582787a1 |
13 | 6510c2b3589b |
14 | 2b85038a0a6d |
15 | 14ce05e6eb3d |
hex | a6ac1514969 |
11453626141033 has 8 divisors (see below), whose sum is σ = 11526512155200. Its totient is φ = 11380938998448.
The previous prime is 11453626141021. The next prime is 11453626141073. The reversal of 11453626141033 is 33014162635411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11453626141033 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11453626141073) 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 7 ways as a sum of consecutive naturals, for example, 49602343 + ... + 49832716.
It is an arithmetic number, because the mean of its divisors is an integer number (1440814019400).
Almost surely, 211453626141033 is an apocalyptic number.
It is an amenable number.
11453626141033 is a deficient number, since it is larger than the sum of its proper divisors (72886014167).
11453626141033 is an equidigital number, since it uses as much as digits as its factorization.
11453626141033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99435791.
The product of its (nonzero) digits is 155520, while the sum is 40.
Adding to 11453626141033 its reverse (33014162635411), we get a palindrome (44467788776444).
The spelling of 11453626141033 in words is "eleven trillion, four hundred fifty-three billion, six hundred twenty-six million, one hundred forty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •