Base | Representation |
---|---|
bin | 10111101110010000100111… |
… | …101111011110001110001100 |
3 | 111200102020022201002122111102 |
4 | 113232100213233132032030 |
5 | 102133402024122413122 |
6 | 1005522214503442232 |
7 | 30655612042014623 |
oct | 2756204757361614 |
9 | 450366281078442 |
10 | 104334012310412 |
11 | 30275895a70295 |
12 | b850769756378 |
13 | 462a869477131 |
14 | 1ba9b165386ba |
15 | c0de78e1a492 |
hex | 5ee427bde38c |
104334012310412 has 24 divisors (see below), whose sum is σ = 189017310664560. Its totient is φ = 50331671570880.
The previous prime is 104334012310397. The next prime is 104334012310483. The reversal of 104334012310412 is 214013210433401.
104334012310412 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1043340123104122 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 325484678 + ... + 325805069.
It is an arithmetic number, because the mean of its divisors is an integer number (7875721277690).
Almost surely, 2104334012310412 is an apocalyptic number.
It is an amenable number.
104334012310412 is a deficient number, since it is larger than the sum of its proper divisors (84683298354148).
104334012310412 is a wasteful number, since it uses less digits than its factorization.
104334012310412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 651291161 (or 651291159 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 104334012310412 its reverse (214013210433401), we get a palindrome (318347222743813).
The spelling of 104334012310412 in words is "one hundred four trillion, three hundred thirty-four billion, twelve million, three hundred ten thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •