Base | Representation |
---|---|
bin | 1010000111111011011001… |
… | …1000011000101111010000 |
3 | 1110102010212211121110110101 |
4 | 2201332312120120233100 |
5 | 2424333420422010112 |
6 | 35401354033142144 |
7 | 2226132326536063 |
oct | 241766630305720 |
9 | 43363784543411 |
10 | 11131320110032 |
11 | 3601848011271 |
12 | 12b93a86ba954 |
13 | 6298a9955085 |
14 | 2a6a8a0b88da |
15 | 144840381757 |
hex | a1fb6618bd0 |
11131320110032 has 10 divisors (see below), whose sum is σ = 21566932713218. Its totient is φ = 5565660055008.
The previous prime is 11131320110017. The next prime is 11131320110039. The reversal of 11131320110032 is 23001102313111.
11131320110032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 6289542346816 + 4841777763216 = 2507896^2 + 2200404^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11131320109991 and 11131320110009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11131320110039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 347853753423 + ... + 347853753454.
Almost surely, 211131320110032 is an apocalyptic number.
It is an amenable number.
11131320110032 is a deficient number, since it is larger than the sum of its proper divisors (10435612603186).
11131320110032 is an equidigital number, since it uses as much as digits as its factorization.
11131320110032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 695707506885 (or 695707506879 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 11131320110032 its reverse (23001102313111), we get a palindrome (34132422423143).
The spelling of 11131320110032 in words is "eleven trillion, one hundred thirty-one billion, three hundred twenty million, one hundred ten thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •