Base | Representation |
---|---|
bin | 1010000111111011010101… |
… | …0000101110001000111010 |
3 | 1110102010211112020222221022 |
4 | 2201332311100232020322 |
5 | 2424333401114321242 |
6 | 35401352122342442 |
7 | 2226132011052245 |
oct | 241766520561072 |
9 | 43363745228838 |
10 | 11131301323322 |
11 | 360183844a564 |
12 | 12b93a235aa22 |
13 | 6298a5aa7c8b |
14 | 2a6a877c825c |
15 | 14483d8c00d2 |
hex | a1fb542e23a |
11131301323322 has 4 divisors (see below), whose sum is σ = 16696951984986. Its totient is φ = 5565650661660.
The previous prime is 11131301323309. The next prime is 11131301323349. The reversal of 11131301323322 is 22332310313111.
11131301323322 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 10291129264441 + 840172058881 = 3207979^2 + 916609^2 .
It is a super-2 number, since 2×111313013233222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11131301323291 and 11131301323300.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2782825330829 + ... + 2782825330832.
Almost surely, 211131301323322 is an apocalyptic number.
11131301323322 is a deficient number, since it is larger than the sum of its proper divisors (5565650661664).
11131301323322 is an equidigital number, since it uses as much as digits as its factorization.
11131301323322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5565650661663.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 11131301323322 its reverse (22332310313111), we get a palindrome (33463611636433).
The spelling of 11131301323322 in words is "eleven trillion, one hundred thirty-one billion, three hundred one million, three hundred twenty-three thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •