Base | Representation |
---|---|
bin | 10101010100010111… |
… | …01101110001000011 |
3 | 1002112122000222000221 |
4 | 22222023231301003 |
5 | 141414423213410 |
6 | 5131404523511 |
7 | 553423006546 |
oct | 125213556103 |
9 | 32478028027 |
10 | 11445132355 |
11 | 494352a378 |
12 | 2274b50597 |
13 | 110520b887 |
14 | 7a806285d |
15 | 46ebba4da |
hex | 2aa2edc43 |
11445132355 has 8 divisors (see below), whose sum is σ = 13922298432. Its totient is φ = 9030679488.
The previous prime is 11445132319. The next prime is 11445132379. The reversal of 11445132355 is 55323154411.
11445132355 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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-11445132355 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11445132355.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 15677899 + ... + 15678628.
It is an arithmetic number, because the mean of its divisors is an integer number (1740287304).
Almost surely, 211445132355 is an apocalyptic number.
11445132355 is a deficient number, since it is larger than the sum of its proper divisors (2477166077).
11445132355 is an equidigital number, since it uses as much as digits as its factorization.
11445132355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31356605.
The product of its digits is 36000, while the sum is 34.
Adding to 11445132355 its reverse (55323154411), we get a palindrome (66768286766).
The spelling of 11445132355 in words is "eleven billion, four hundred forty-five million, one hundred thirty-two thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •