Base | Representation |
---|---|
bin | 1010000010000110100010… |
… | …1010101010100110001001 |
3 | 1110001120112112020020122111 |
4 | 2200201220222222212021 |
5 | 2421213430344443423 |
6 | 35243402242222321 |
7 | 2215660133105530 |
oct | 240415052524611 |
9 | 43046475206574 |
10 | 11031232031113 |
11 | 3573356997178 |
12 | 12a1b153549a1 |
13 | 620318b16c38 |
14 | 2a1cb348b317 |
15 | 141e3354960d |
hex | a0868aaa989 |
11031232031113 has 8 divisors (see below), whose sum is σ = 12724945895232. Its totient is φ = 9366974060496.
The previous prime is 11031232031069. The next prime is 11031232031119. The reversal of 11031232031113 is 31113023213011.
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-11031232031113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11031232031119) 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 7 ways as a sum of consecutive naturals, for example, 7363972570 + ... + 7363974067.
It is an arithmetic number, because the mean of its divisors is an integer number (1590618236904).
Almost surely, 211031232031113 is an apocalyptic number.
It is an amenable number.
11031232031113 is a deficient number, since it is larger than the sum of its proper divisors (1693713864119).
11031232031113 is a wasteful number, since it uses less digits than its factorization.
11031232031113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14727946751.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 11031232031113 its reverse (31113023213011), we get a palindrome (42144255244124).
The spelling of 11031232031113 in words is "eleven trillion, thirty-one billion, two hundred thirty-two million, thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •