Base | Representation |
---|---|
bin | 11011010010110101000000… |
… | …111110010011011011010111 |
3 | 120202000211010211001212020111 |
4 | 123102311000332103123113 |
5 | 111213223214020431411 |
6 | 1103150045001343451 |
7 | 34166454063160165 |
oct | 3322650076233327 |
9 | 522024124055214 |
10 | 120041131030231 |
11 | 35281181000a84 |
12 | 11568937a97b87 |
13 | 51c9aa3905a98 |
14 | 2190043936235 |
15 | dd282a5a2721 |
hex | 6d2d40f936d7 |
120041131030231 has 12 divisors (see below), whose sum is σ = 128582528769912. Its totient is φ = 112025815895664.
The previous prime is 120041131030217. The next prime is 120041131030237. The reversal of 120041131030231 is 132030131140021.
It is not a de Polignac number, because 120041131030231 - 25 = 120041131030199 is a prime.
It is a super-2 number, since 2×1200411310302312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120041131030237) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2481497520 + ... + 2481545893.
It is an arithmetic number, because the mean of its divisors is an integer number (10715210730826).
Almost surely, 2120041131030231 is an apocalyptic number.
120041131030231 is a deficient number, since it is larger than the sum of its proper divisors (8541397739681).
120041131030231 is an equidigital number, since it uses as much as digits as its factorization.
120041131030231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4963043518 (or 4963043499 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 120041131030231 its reverse (132030131140021), we get a palindrome (252071262170252).
The spelling of 120041131030231 in words is "one hundred twenty trillion, forty-one billion, one hundred thirty-one million, thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •