Base | Representation |
---|---|
bin | 101000010000100100110… |
… | …0100010011111110010011 |
3 | 201120222000212220200121220 |
4 | 1100201021210103332103 |
5 | 1211123343421224021 |
6 | 15433521153020123 |
7 | 1110520445055516 |
oct | 120411144237623 |
9 | 21528025820556 |
10 | 5533152133011 |
11 | 1843662148198 |
12 | 754441554643 |
13 | 311a0a656399 |
14 | 151b3d8dcd7d |
15 | 98de3a73cc6 |
hex | 50849913f93 |
5533152133011 has 8 divisors (see below), whose sum is σ = 7378902662400. Its totient is φ = 3688084846152.
The previous prime is 5533152133007. The next prime is 5533152133027. The reversal of 5533152133011 is 1103312513355.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5533152133011 - 22 = 5533152133007 is a prime.
It is a super-2 number, since 2×55331521330112 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5533152133111) 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, 170791735 + ... + 170824128.
It is an arithmetic number, because the mean of its divisors is an integer number (922362832800).
Almost surely, 25533152133011 is an apocalyptic number.
5533152133011 is a deficient number, since it is larger than the sum of its proper divisors (1845750529389).
5533152133011 is a wasteful number, since it uses less digits than its factorization.
5533152133011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 341621265.
The product of its (nonzero) digits is 20250, while the sum is 33.
Adding to 5533152133011 its reverse (1103312513355), we get a palindrome (6636464646366).
The spelling of 5533152133011 in words is "five trillion, five hundred thirty-three billion, one hundred fifty-two million, one hundred thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •