Base | Representation |
---|---|
bin | 11101001000111100000… |
… | …01111111111001101011 |
3 | 10112201100112011220021001 |
4 | 32210132001333321223 |
5 | 112401010143022311 |
6 | 2043543111455431 |
7 | 132223304644456 |
oct | 16443601777153 |
9 | 3481315156231 |
10 | 1001231220331 |
11 | 35668aa15a61 |
12 | 142066387577 |
13 | 735533a1594 |
14 | 36661b8249d |
15 | 1b09e8bc4c1 |
hex | e91e07fe6b |
1001231220331 has 8 divisors (see below), whose sum is σ = 1035761260544. Its totient is φ = 966840696360.
The previous prime is 1001231220317. The next prime is 1001231220383. The reversal of 1001231220331 is 1330221321001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1001231220331 - 27 = 1001231220203 is a prime.
It is a super-2 number, since 2×10012312203312 (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 = 1001231220299 and 1001231220308.
It is not an unprimeable number, because it can be changed into a prime (1001231220391) 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, 34864461 + ... + 34893166.
It is an arithmetic number, because the mean of its divisors is an integer number (129470157568).
Almost surely, 21001231220331 is an apocalyptic number.
1001231220331 is a deficient number, since it is larger than the sum of its proper divisors (34530040213).
1001231220331 is an equidigital number, since it uses as much as digits as its factorization.
1001231220331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69758121.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1001231220331 its reverse (1330221321001), we get a palindrome (2331452541332).
The spelling of 1001231220331 in words is "one trillion, one billion, two hundred thirty-one million, two hundred twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •