Base | Representation |
---|---|
bin | 11101000111100101100… |
… | …111000011000100111001 |
3 | 21002021221222010100111212 |
4 | 131013211213003010321 |
5 | 230241033033330241 |
6 | 4131130251532505 |
7 | 264365641313261 |
oct | 35074547030471 |
9 | 7067858110455 |
10 | 2001012011321 |
11 | 701696128984 |
12 | 283986a5a135 |
13 | 11690511873b |
14 | 6cbc70467a1 |
15 | 370b6c82beb |
hex | 1d1e59c3139 |
2001012011321 has 4 divisors (see below), whose sum is σ = 2034927469200. Its totient is φ = 1967096553444.
The previous prime is 2001012011311. The next prime is 2001012011399. The reversal of 2001012011321 is 1231102101002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2001012011321 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2001012011296 and 2001012011305.
It is not an unprimeable number, because it can be changed into a prime (2001012011311) 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, 16957728851 + ... + 16957728968.
It is an arithmetic number, because the mean of its divisors is an integer number (508731867300).
Almost surely, 22001012011321 is an apocalyptic number.
It is an amenable number.
2001012011321 is a deficient number, since it is larger than the sum of its proper divisors (33915457879).
2001012011321 is an equidigital number, since it uses as much as digits as its factorization.
2001012011321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33915457878.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 2001012011321 its reverse (1231102101002), we get a palindrome (3232114112323).
The spelling of 2001012011321 in words is "two trillion, one billion, twelve million, eleven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •