Base | Representation |
---|---|
bin | 11110111111110101101… |
… | …100111001111110001110 |
3 | 21112122020111021122111022 |
4 | 132333311230321332032 |
5 | 234400002014014410 |
6 | 4310322455554142 |
7 | 306616426523141 |
oct | 36776554717616 |
9 | 7478214248438 |
10 | 2130131001230 |
11 | 7514244660a1 |
12 | 2a4a0068b952 |
13 | 125b4161530b |
14 | 751554da058 |
15 | 3a6225bb455 |
hex | 1eff5b39f8e |
2130131001230 has 8 divisors (see below), whose sum is σ = 3834235802232. Its totient is φ = 852052400488.
The previous prime is 2130131001181. The next prime is 2130131001239. The reversal of 2130131001230 is 321001310312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×21301310012302 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2130131001199 and 2130131001208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2130131001239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 106506550052 + ... + 106506550071.
It is an arithmetic number, because the mean of its divisors is an integer number (479279475279).
Almost surely, 22130131001230 is an apocalyptic number.
2130131001230 is a deficient number, since it is larger than the sum of its proper divisors (1704104801002).
2130131001230 is a wasteful number, since it uses less digits than its factorization.
2130131001230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213013100130.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 2130131001230 its reverse (321001310312), we get a palindrome (2451132311542).
The spelling of 2130131001230 in words is "two trillion, one hundred thirty billion, one hundred thirty-one million, one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •