Base | Representation |
---|---|
bin | 11011010100001001000001… |
… | …110110101001010010001000 |
3 | 120202100102222122101002001021 |
4 | 123110021001312221102020 |
5 | 111221212441032104112 |
6 | 1103255324211202224 |
7 | 34206126411550453 |
oct | 3324110166512210 |
9 | 522312878332037 |
10 | 120131340113032 |
11 | 35306462749076 |
12 | 115823128a6374 |
13 | 520544bb425a1 |
14 | 21945604dc49a |
15 | dd4d59e7e907 |
hex | 6d4241da9488 |
120131340113032 has 32 divisors (see below), whose sum is σ = 225311840196480. Its totient is φ = 60048183867840.
The previous prime is 120131340113027. The next prime is 120131340113039. The reversal of 120131340113032 is 230311043131021.
It is a junction number, because it is equal to n+sod(n) for n = 120131340112988 and 120131340113006.
It is not an unprimeable number, because it can be changed into a prime (120131340113039) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1194205057 + ... + 1194305647.
It is an arithmetic number, because the mean of its divisors is an integer number (7040995006140).
Almost surely, 2120131340113032 is an apocalyptic number.
It is an amenable number.
120131340113032 is a deficient number, since it is larger than the sum of its proper divisors (105180500083448).
120131340113032 is a wasteful number, since it uses less digits than its factorization.
120131340113032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142573 (or 142569 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 120131340113032 its reverse (230311043131021), we get a palindrome (350442383244053).
The spelling of 120131340113032 in words is "one hundred twenty trillion, one hundred thirty-one billion, three hundred forty million, one hundred thirteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •