Base | Representation |
---|---|
bin | 101101110110000110101110… |
… | …001001110101000100111101 |
3 | 222102220122200122010122211022 |
4 | 231312012232021311010331 |
5 | 202412002032322214010 |
6 | 1552455341212233525 |
7 | 60320204236532135 |
oct | 5566065611650475 |
9 | 872818618118738 |
10 | 201630161523005 |
11 | 59277964768456 |
12 | 1a74533916b8a5 |
13 | 8867847b81a47 |
14 | 37b0d47da3ac5 |
15 | 1849ce3555d55 |
hex | b761ae27513d |
201630161523005 has 4 divisors (see below), whose sum is σ = 241956193827612. Its totient is φ = 161304129218400.
The previous prime is 201630161522983. The next prime is 201630161523029. The reversal of 201630161523005 is 500325161036102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 108507159722329 + 93123001800676 = 10416677^2 + 9650026^2 .
It is not a de Polignac number, because 201630161523005 - 240 = 200530649895229 is a prime.
It is a super-2 number, since 2×2016301615230052 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20163016152296 + ... + 20163016152305.
It is an arithmetic number, because the mean of its divisors is an integer number (60489048456903).
Almost surely, 2201630161523005 is an apocalyptic number.
It is an amenable number.
201630161523005 is a deficient number, since it is larger than the sum of its proper divisors (40326032304607).
201630161523005 is an equidigital number, since it uses as much as digits as its factorization.
201630161523005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40326032304606.
The product of its (nonzero) digits is 32400, while the sum is 35.
The spelling of 201630161523005 in words is "two hundred one trillion, six hundred thirty billion, one hundred sixty-one million, five hundred twenty-three thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •