Base | Representation |
---|---|
bin | 1011000000111001011001… |
… | …0010110111001010000111 |
3 | 1120212201010010002110000212 |
4 | 2300032112102313022013 |
5 | 3041402322242144333 |
6 | 41431134543430035 |
7 | 2356630640303051 |
oct | 260162622671207 |
9 | 46781103073025 |
10 | 12110034334343 |
11 | 3949922745900 |
12 | 1437009bb531b |
13 | 69ac8204b56a |
14 | 2dc1b357c8d1 |
15 | 16002304b448 |
hex | b03964b7287 |
12110034334343 has 24 divisors (see below), whose sum is σ = 13444336856160. Its totient is φ = 10898892488000.
The previous prime is 12110034334313. The next prime is 12110034334379. The reversal of 12110034334343 is 34343343001121.
It is a happy number.
It is not a de Polignac number, because 12110034334343 - 220 = 12110033285767 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12110034334313) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 118724921 + ... + 118826877.
It is an arithmetic number, because the mean of its divisors is an integer number (560180702340).
Almost surely, 212110034334343 is an apocalyptic number.
12110034334343 is a deficient number, since it is larger than the sum of its proper divisors (1334302521817).
12110034334343 is a wasteful number, since it uses less digits than its factorization.
12110034334343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111799 (or 111788 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 32.
Adding to 12110034334343 its reverse (34343343001121), we get a palindrome (46453377335464).
It can be divided in two parts, 121100 and 34334343, that added together give a palindrome (34455443).
The spelling of 12110034334343 in words is "twelve trillion, one hundred ten billion, thirty-four million, three hundred thirty-four thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •