Base | Representation |
---|---|
bin | 1011000010000111100000… |
… | …0101000000001100010100 |
3 | 1120221201020101212110121212 |
4 | 2300201320011000030110 |
5 | 3042223243032040312 |
6 | 41444523330200552 |
7 | 2361302354351651 |
oct | 260417005001424 |
9 | 46851211773555 |
10 | 12131002221332 |
11 | 3957802554725 |
12 | 143b0a0123158 |
13 | 69cc440cb697 |
14 | 2dd202212c28 |
15 | 16084dc53822 |
hex | b0878140314 |
12131002221332 has 6 divisors (see below), whose sum is σ = 21229253887338. Its totient is φ = 6065501110664.
The previous prime is 12131002221329. The next prime is 12131002221361. The reversal of 12131002221332 is 23312220013121.
It can be written as a sum of positive squares in only one way, i.e., 11879644382596 + 251357838736 = 3446686^2 + 501356^2 .
It is a super-2 number, since 2×121310022213322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12131002221298 and 12131002221307.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1516375277663 + ... + 1516375277670.
It is an arithmetic number, because the mean of its divisors is an integer number (3538208981223).
Almost surely, 212131002221332 is an apocalyptic number.
It is an amenable number.
12131002221332 is a deficient number, since it is larger than the sum of its proper divisors (9098251666006).
12131002221332 is a wasteful number, since it uses less digits than its factorization.
12131002221332 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3032750555337 (or 3032750555335 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 12131002221332 its reverse (23312220013121), we get a palindrome (35443222234453).
The spelling of 12131002221332 in words is "twelve trillion, one hundred thirty-one billion, two million, two hundred twenty-one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.153 sec. • engine limits •