Base | Representation |
---|---|
bin | 1010011010101010010010… |
… | …1010001001101000000001 |
3 | 1111112220120101112020100210 |
4 | 2212222210222021220001 |
5 | 3000122020200332113 |
6 | 40205300300304333 |
7 | 2261314421656110 |
oct | 246524452115001 |
9 | 44486511466323 |
10 | 11453145324033 |
11 | 3716284a52906 |
12 | 134b8432420a9 |
13 | 65104733909a |
14 | 2b8499a9dc77 |
15 | 14cdc8b456c3 |
hex | a6aa4a89a01 |
11453145324033 has 16 divisors (see below), whose sum is σ = 17748215516160. Its totient is φ = 6433728123216.
The previous prime is 11453145324013. The next prime is 11453145324037. The reversal of 11453145324033 is 33042354135411.
It is not a de Polignac number, because 11453145324033 - 26 = 11453145323969 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11453145323982 and 11453145324000.
It is not an unprimeable number, because it can be changed into a prime (11453145324037) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 4621929885 + ... + 4621932362.
It is an arithmetic number, because the mean of its divisors is an integer number (1109263469760).
Almost surely, 211453145324033 is an apocalyptic number.
It is an amenable number.
11453145324033 is a deficient number, since it is larger than the sum of its proper divisors (6295070192127).
11453145324033 is an equidigital number, since it uses as much as digits as its factorization.
11453145324033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9243862316.
The product of its (nonzero) digits is 259200, while the sum is 39.
Adding to 11453145324033 its reverse (33042354135411), we get a palindrome (44495499459444).
The spelling of 11453145324033 in words is "eleven trillion, four hundred fifty-three billion, one hundred forty-five million, three hundred twenty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.231 sec. • engine limits •