Base | Representation |
---|---|
bin | 1011000000111001010011… |
… | …0111010011000010111011 |
3 | 1120212201001102220222002010 |
4 | 2300032110313103002323 |
5 | 3041402300121100243 |
6 | 41431132325141003 |
7 | 2356630226262312 |
oct | 260162467230273 |
9 | 46781042828063 |
10 | 12110010331323 |
11 | 3949910140aa3 |
12 | 1437001b5a763 |
13 | 69ac7a0960a8 |
14 | 2dc1b02d1279 |
15 | 160020da9433 |
hex | b0394dd30bb |
12110010331323 has 16 divisors (see below), whose sum is σ = 16220067432480. Its totient is φ = 8036696216064.
The previous prime is 12110010331271. The next prime is 12110010331361. The reversal of 12110010331323 is 32313301001121.
It is a happy number.
12110010331323 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12110010331323 - 29 = 12110010330811 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12110010331323.
It is not an unprimeable number, because it can be changed into a prime (12110010331123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5206686 + ... + 7164467.
It is an arithmetic number, because the mean of its divisors is an integer number (1013754214530).
Almost surely, 212110010331323 is an apocalyptic number.
12110010331323 is a deficient number, since it is larger than the sum of its proper divisors (4110057101157).
12110010331323 is a wasteful number, since it uses less digits than its factorization.
12110010331323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12372638.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 12110010331323 its reverse (32313301001121), we get a palindrome (44423311332444).
The spelling of 12110010331323 in words is "twelve trillion, one hundred ten billion, ten million, three hundred thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •