Base | Representation |
---|---|
bin | 1011000010110010011100… |
… | …1101100100010110111100 |
3 | 1120222210222211012100000010 |
4 | 2300230213031210112330 |
5 | 3042420400241222022 |
6 | 41454111303303220 |
7 | 2362161136362105 |
oct | 260544715442674 |
9 | 46883884170003 |
10 | 12142530414012 |
11 | 3961688955499 |
12 | 1441378a4ab10 |
13 | 6a106059c57b |
14 | 2dd9b72d73ac |
15 | 160cc5d7950c |
hex | b0b273645bc |
12142530414012 has 48 divisors (see below), whose sum is σ = 29100349523840. Its totient is φ = 3937842775872.
The previous prime is 12142530413989. The next prime is 12142530414023. The reversal of 12142530414012 is 21041403524121.
12142530414012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×121425304140122 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5453703 + ... + 7350369.
Almost surely, 212142530414012 is an apocalyptic number.
12142530414012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12142530414012 is an abundant number, since it is smaller than the sum of its proper divisors (16957819109828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12142530414012 is a wasteful number, since it uses less digits than its factorization.
12142530414012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1911130 (or 1911128 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 30.
Adding to 12142530414012 its reverse (21041403524121), we get a palindrome (33183933938133).
The spelling of 12142530414012 in words is "twelve trillion, one hundred forty-two billion, five hundred thirty million, four hundred fourteen thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •