Base | Representation |
---|---|
bin | 1010111011010001000001… |
… | …1111100010011111100000 |
3 | 1120112110102112210210112201 |
4 | 2232310100133202133200 |
5 | 3033311214324330422 |
6 | 41314500044102544 |
7 | 2346634531055416 |
oct | 256642037423740 |
9 | 46473375723481 |
10 | 12013300230112 |
11 | 39118a2880615 |
12 | 1420311b34a54 |
13 | 691b0704002c |
14 | 2d763817b2b6 |
15 | 15c7608c9727 |
hex | aed107e27e0 |
12013300230112 has 24 divisors (see below), whose sum is σ = 23667133124376. Its totient is φ = 6002599754112.
The previous prime is 12013300230091. The next prime is 12013300230119. The reversal of 12013300230112 is 21103200331021.
12013300230112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 12013300230112.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12013300230119) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 126525583 + ... + 126620494.
It is an arithmetic number, because the mean of its divisors is an integer number (986130546849).
Almost surely, 212013300230112 is an apocalyptic number.
It is an amenable number.
12013300230112 is a deficient number, since it is larger than the sum of its proper divisors (11653832894264).
12013300230112 is a wasteful number, since it uses less digits than its factorization.
12013300230112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 253147570 (or 253147562 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 12013300230112 its reverse (21103200331021), we get a palindrome (33116500561133).
The spelling of 12013300230112 in words is "twelve trillion, thirteen billion, three hundred million, two hundred thirty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •