Base | Representation |
---|---|
bin | 1010000010000110011011… |
… | …0100011000010100000001 |
3 | 1110001120110100212212211111 |
4 | 2200201212310120110001 |
5 | 2421213344430220413 |
6 | 35243355213443321 |
7 | 2215656305411536 |
oct | 240414664302401 |
9 | 43046410785744 |
10 | 11031201023233 |
11 | 3573340438526 |
12 | 12a1b06aa0541 |
13 | 62031257b291 |
14 | 2a1cad2d8d8d |
15 | 141e30971d3d |
hex | a0866d18501 |
11031201023233 has 8 divisors (see below), whose sum is σ = 11153993152680. Its totient is φ = 10908593963520.
The previous prime is 11031201023231. The next prime is 11031201023243. The reversal of 11031201023233 is 33232010213011.
It can be written as a sum of positive squares in 4 ways, for example, as 2379790619649 + 8651410403584 = 1542657^2 + 2941328^2 .
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 11031201023233 - 21 = 11031201023231 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11031201023231) 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, 46147558 + ... + 46385983.
It is an arithmetic number, because the mean of its divisors is an integer number (1394249144085).
Almost surely, 211031201023233 is an apocalyptic number.
It is an amenable number.
11031201023233 is a deficient number, since it is larger than the sum of its proper divisors (122792129447).
11031201023233 is an equidigital number, since it uses as much as digits as its factorization.
11031201023233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92534867.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 11031201023233 its reverse (33232010213011), we get a palindrome (44263211236244).
The spelling of 11031201023233 in words is "eleven trillion, thirty-one billion, two hundred one million, twenty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •