Base | Representation |
---|---|
bin | 1010001101101011000011… |
… | …1000100010010000010011 |
3 | 1110202120121212001010121202 |
4 | 2203122300320202100103 |
5 | 2432443031100402011 |
6 | 35514555113341415 |
7 | 2236225112024555 |
oct | 243326070422023 |
9 | 43676555033552 |
10 | 11230012122131 |
11 | 363a692093730 |
12 | 131455040786b |
13 | 635ca7490a7a |
14 | 2ab76d5394d5 |
15 | 1471b984e23b |
hex | a36b0e22413 |
11230012122131 has 16 divisors (see below), whose sum is σ = 12346321242240. Its totient is φ = 10129852438080.
The previous prime is 11230012122107. The next prime is 11230012122181. The reversal of 11230012122131 is 13122121003211.
It is a cyclic number.
It is not a de Polignac number, because 11230012122131 - 242 = 6831965611027 is a prime.
It is a super-2 number, since 2×112300121221312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11230012122181) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5340221 + ... + 7139886.
It is an arithmetic number, because the mean of its divisors is an integer number (771645077640).
Almost surely, 211230012122131 is an apocalyptic number.
11230012122131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11230012122131 is a deficient number, since it is larger than the sum of its proper divisors (1116309120109).
11230012122131 is a wasteful number, since it uses less digits than its factorization.
11230012122131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12480754.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 11230012122131 its reverse (13122121003211), we get a palindrome (24352133125342).
The spelling of 11230012122131 in words is "eleven trillion, two hundred thirty billion, twelve million, one hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •