Base | Representation |
---|---|
bin | 1011000110010101100111… |
… | …1000010010000010110100 |
3 | 1121012122101121001222111021 |
4 | 2301211121320102002310 |
5 | 3044420242030423012 |
6 | 41542114243550524 |
7 | 2366450232414613 |
oct | 261453170220264 |
9 | 47178347058437 |
10 | 12203510014132 |
11 | 3985530292628 |
12 | 145115698b444 |
13 | 6a6a2ac734a8 |
14 | 30291dd0787a |
15 | 1626945ce007 |
hex | b1959e120b4 |
12203510014132 has 12 divisors (see below), whose sum is σ = 21356424276516. Its totient is φ = 6101674506560.
The previous prime is 12203510014127. The next prime is 12203510014159. The reversal of 12203510014132 is 23141001530221.
It can be written as a sum of positive squares in 2 ways, for example, as 11584792478736 + 618717535396 = 3403644^2 + 786586^2 .
It is a junction number, because it is equal to n+sod(n) for n = 12203510014097 and 12203510014106.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19783393 + ... + 20390920.
It is an arithmetic number, because the mean of its divisors is an integer number (1779702023043).
Almost surely, 212203510014132 is an apocalyptic number.
It is an amenable number.
12203510014132 is a deficient number, since it is larger than the sum of its proper divisors (9152914262384).
12203510014132 is a wasteful number, since it uses less digits than its factorization.
12203510014132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40250258 (or 40250256 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 12203510014132 its reverse (23141001530221), we get a palindrome (35344511544353).
The spelling of 12203510014132 in words is "twelve trillion, two hundred three billion, five hundred ten million, fourteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •