Base | Representation |
---|---|
bin | 1010001001001100010010… |
… | …1001000111101001110010 |
3 | 1110111012221010112020022100 |
4 | 2202103010221013221302 |
5 | 2430212403224322002 |
6 | 35415344433521230 |
7 | 2230531404426462 |
oct | 242230451075162 |
9 | 43435833466270 |
10 | 11153034214002 |
11 | 360aa80066a3a |
12 | 1301648713216 |
13 | 62b95a4a6ac5 |
14 | 2a7b49cb7ba2 |
15 | 1451b183a11c |
hex | a24c4a47a72 |
11153034214002 has 12 divisors (see below), whose sum is σ = 24164907463710. Its totient is φ = 3717678071328.
The previous prime is 11153034214001. The next prime is 11153034214013. The reversal of 11153034214002 is 20041243035111.
11153034214002 is a `hidden beast` number, since 111 + 530 + 3 + 4 + 2 + 14 + 0 + 0 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 10443684525561 + 709349688441 = 3231669^2 + 842229^2 .
It is not an unprimeable number, because it can be changed into a prime (11153034214001) 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 5 ways as a sum of consecutive naturals, for example, 309806505927 + ... + 309806505962.
Almost surely, 211153034214002 is an apocalyptic number.
11153034214002 is an abundant number, since it is smaller than the sum of its proper divisors (13011873249708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11153034214002 is a wasteful number, since it uses less digits than its factorization.
11153034214002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 619613011897 (or 619613011894 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 11153034214002 its reverse (20041243035111), we get a palindrome (31194277249113).
The spelling of 11153034214002 in words is "eleven trillion, one hundred fifty-three billion, thirty-four million, two hundred fourteen thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •