Base | Representation |
---|---|
bin | 11011010100000111111111… |
… | …001001100100100101000111 |
3 | 120202100100002122120021222122 |
4 | 123110013333021210211013 |
5 | 111221203143034013111 |
6 | 1103255021152520155 |
7 | 34206056602344323 |
oct | 3324077711444507 |
9 | 522310078507878 |
10 | 120130221001031 |
11 | 35305a38a6a71a |
12 | 1158205bb5005b |
13 | 520530102c737 |
14 | 2194495a26983 |
15 | dd4ce1ac0cdb |
hex | 6d41ff264947 |
120130221001031 has 4 divisors (see below), whose sum is σ = 120130243429200. Its totient is φ = 120130198572864.
The previous prime is 120130221001027. The next prime is 120130221001033. The reversal of 120130221001031 is 130100122031021.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 120130221001031 - 22 = 120130221001027 is a prime.
It is a super-2 number, since 2×1201302210010312 (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 (120130221001033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2049335 + ... + 15635223.
It is an arithmetic number, because the mean of its divisors is an integer number (30032560857300).
Almost surely, 2120130221001031 is an apocalyptic number.
120130221001031 is a deficient number, since it is larger than the sum of its proper divisors (22428169).
120130221001031 is an equidigital number, since it uses as much as digits as its factorization.
120130221001031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22428168.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 120130221001031 its reverse (130100122031021), we get a palindrome (250230343032052).
The spelling of 120130221001031 in words is "one hundred twenty trillion, one hundred thirty billion, two hundred twenty-one million, one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •