Base | Representation |
---|---|
bin | 11101000111111001110… |
… | …100101011101110101111 |
3 | 21002022211121020100221002 |
4 | 131013321310223232233 |
5 | 230242231342130111 |
6 | 4131224044230515 |
7 | 264410226630461 |
oct | 35077164535657 |
9 | 7068747210832 |
10 | 2001351130031 |
11 | 70184a5a0880 |
12 | 283a6053b43b |
13 | 11695a461bb6 |
14 | 6cc1a0c0131 |
15 | 370d691c63b |
hex | 1d1f9d2bbaf |
2001351130031 has 8 divisors (see below), whose sum is σ = 2183303199744. Its totient is φ = 1819400903320.
The previous prime is 2001351130027. The next prime is 2001351130049. The reversal of 2001351130031 is 1300311531002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2001351130031 - 22 = 2001351130027 is a prime.
It is a super-2 number, since 2×20013511300312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2001351129985 and 2001351130012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2001351130531) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2834546 + ... + 3469488.
It is an arithmetic number, because the mean of its divisors is an integer number (272912899968).
Almost surely, 22001351130031 is an apocalyptic number.
2001351130031 is a deficient number, since it is larger than the sum of its proper divisors (181952069713).
2001351130031 is a wasteful number, since it uses less digits than its factorization.
2001351130031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 921501.
The product of its (nonzero) digits is 270, while the sum is 20.
Adding to 2001351130031 its reverse (1300311531002), we get a palindrome (3301662661033).
The spelling of 2001351130031 in words is "two trillion, one billion, three hundred fifty-one million, one hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •