Base | Representation |
---|---|
bin | 1011000000111010011011… |
… | …0010110001000010001011 |
3 | 1120212201211101221021211221 |
4 | 2300032212302301002023 |
5 | 3041403404122231243 |
6 | 41431222232302511 |
7 | 2356640541122134 |
oct | 260164662610213 |
9 | 46781741837757 |
10 | 12110311133323 |
11 | 3949a54a12a97 |
12 | 1437086841a37 |
13 | 69acc74b4c40 |
14 | 2dc1dc232c8b |
15 | 16003c4c5bed |
hex | b03a6cb108b |
12110311133323 has 16 divisors (see below), whose sum is σ = 13287985016320. Its totient is φ = 10969532275104.
The previous prime is 12110311133309. The next prime is 12110311133351. The reversal of 12110311133323 is 32333111301121.
It is not a de Polignac number, because 12110311133323 - 225 = 12110277578891 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12110311113323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 36004161 + ... + 36338962.
It is an arithmetic number, because the mean of its divisors is an integer number (830499063520).
Almost surely, 212110311133323 is an apocalyptic number.
12110311133323 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
12110311133323 is a deficient number, since it is larger than the sum of its proper divisors (1177673882997).
12110311133323 is a wasteful number, since it uses less digits than its factorization.
12110311133323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72343378.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 12110311133323 its reverse (32333111301121), we get a palindrome (44443422434444).
The spelling of 12110311133323 in words is "twelve trillion, one hundred ten billion, three hundred eleven million, one hundred thirty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •