Base | Representation |
---|---|
bin | 1010001111001101100001… |
… | …0011100010011110100011 |
3 | 1110212002211212222220111212 |
4 | 2203303120103202132203 |
5 | 2433411143442104011 |
6 | 35535045541500335 |
7 | 2241152105332316 |
oct | 243633023423643 |
9 | 43762755886455 |
10 | 11256443316131 |
11 | 364a915884a12 |
12 | 13196a81116ab |
13 | 63862a378330 |
14 | 2acb599d497d |
15 | 147c14ec908b |
hex | a3cd84e27a3 |
11256443316131 has 8 divisors (see below), whose sum is σ = 12132675699984. Its totient is φ = 10381689807840.
The previous prime is 11256443316119. The next prime is 11256443316179. The reversal of 11256443316131 is 13161334465211.
11256443316131 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 not a de Polignac number, because 11256443316131 - 26 = 11256443316067 is a prime.
It is a super-2 number, since 2×112564433161312 (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 (11256443396131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 369703076 + ... + 369733521.
It is an arithmetic number, because the mean of its divisors is an integer number (1516584462498).
Almost surely, 211256443316131 is an apocalyptic number.
11256443316131 is a deficient number, since it is larger than the sum of its proper divisors (876232383853).
11256443316131 is a wasteful number, since it uses less digits than its factorization.
11256443316131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 739437781.
The product of its digits is 155520, while the sum is 41.
The spelling of 11256443316131 in words is "eleven trillion, two hundred fifty-six billion, four hundred forty-three million, three hundred sixteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •