Base | Representation |
---|---|
bin | 101101110000010010001000… |
… | …101100011011110111001111 |
3 | 222101111102001201212120211122 |
4 | 231300102020230123313033 |
5 | 202333423221340231111 |
6 | 1551551455433111155 |
7 | 60246252332211521 |
oct | 5560221054336717 |
9 | 871442051776748 |
10 | 201230101102031 |
11 | 59133230017971 |
12 | 1a69b8a98584bb |
13 | 8838bbcb79c61 |
14 | 3799835b93a11 |
15 | 183e6cb6c4cdb |
hex | b70488b1bdcf |
201230101102031 has 8 divisors (see below), whose sum is σ = 207115110425328. Its totient is φ = 195391613592000.
The previous prime is 201230101102001. The next prime is 201230101102039. The reversal of 201230101102031 is 130201101032102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-201230101102031 is a prime.
It is a super-2 number, since 2×2012301011020312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201230101102039) 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, 11630444540 + ... + 11630461841.
It is an arithmetic number, because the mean of its divisors is an integer number (25889388803166).
Almost surely, 2201230101102031 is an apocalyptic number.
201230101102031 is a deficient number, since it is larger than the sum of its proper divisors (5885009323297).
201230101102031 is a wasteful number, since it uses less digits than its factorization.
201230101102031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23260906633.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 201230101102031 its reverse (130201101032102), we get a palindrome (331431202134133).
The spelling of 201230101102031 in words is "two hundred one trillion, two hundred thirty billion, one hundred one million, one hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •