Base | Representation |
---|---|
bin | 101101101101011001110110… |
… | …101111000111110110101001 |
3 | 222100210111022211222020102010 |
4 | 231231121312233013312221 |
5 | 202322203002204233001 |
6 | 1551320533201030133 |
7 | 60226046045631453 |
oct | 5555316657076651 |
9 | 870714284866363 |
10 | 201032231321001 |
11 | 59067321754813 |
12 | 1a669487625349 |
13 | 8823347c994a2 |
14 | 37900249872d3 |
15 | 183949a2868d6 |
hex | b6d676bc7da9 |
201032231321001 has 4 divisors (see below), whose sum is σ = 268042975094672. Its totient is φ = 134021487547332.
The previous prime is 201032231320997. The next prime is 201032231321057. The reversal of 201032231321001 is 100123132230102.
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 not a de Polignac number, because 201032231321001 - 22 = 201032231320997 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201032231320001) 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, 33505371886831 + ... + 33505371886836.
It is an arithmetic number, because the mean of its divisors is an integer number (67010743773668).
Almost surely, 2201032231321001 is an apocalyptic number.
It is an amenable number.
201032231321001 is a deficient number, since it is larger than the sum of its proper divisors (67010743773671).
201032231321001 is an equidigital number, since it uses as much as digits as its factorization.
201032231321001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67010743773670.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 201032231321001 its reverse (100123132230102), we get a palindrome (301155363551103).
The spelling of 201032231321001 in words is "two hundred one trillion, thirty-two billion, two hundred thirty-one million, three hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •