Base | Representation |
---|---|
bin | 1010010010011000111000… |
… | …0111000101000111101111 |
3 | 1111001022202100022211002010 |
4 | 2210212032013011013233 |
5 | 2440304443434023043 |
6 | 40020114502332303 |
7 | 2245123642045302 |
oct | 244461607050757 |
9 | 44038670284063 |
10 | 11311033111023 |
11 | 3670a89349888 |
12 | 13281a212a093 |
13 | 640819ca1309 |
14 | 2b1657b26b39 |
15 | 14935c798133 |
hex | a498e1c51ef |
11311033111023 has 8 divisors (see below), whose sum is σ = 15081439154688. Its totient is φ = 7540657904024.
The previous prime is 11311033111019. The next prime is 11311033111067. The reversal of 11311033111023 is 32011133011311.
11311033111023 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 a cyclic number.
It is not a de Polignac number, because 11311033111023 - 22 = 11311033111019 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11311033110023) 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, 6839265 + ... + 8330522.
It is an arithmetic number, because the mean of its divisors is an integer number (1885179894336).
Almost surely, 211311033111023 is an apocalyptic number.
11311033111023 is a deficient number, since it is larger than the sum of its proper divisors (3770406043665).
11311033111023 is a wasteful number, since it uses less digits than its factorization.
11311033111023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15418333.
The product of its (nonzero) digits is 162, while the sum is 21.
Adding to 11311033111023 its reverse (32011133011311), we get a palindrome (43322166122334).
The spelling of 11311033111023 in words is "eleven trillion, three hundred eleven billion, thirty-three million, one hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •