Base | Representation |
---|---|
bin | 1101101101110011010010… |
… | …11111011110001011011111 |
3 | 10221210100220001110000022000 |
4 | 12312321221133132023133 |
5 | 12423124242213212041 |
6 | 144051441435253343 |
7 | 6232030305526002 |
oct | 666715137361337 |
9 | 127710801400260 |
10 | 30161030210271 |
11 | 9679248291464 |
12 | 34714abbaa253 |
13 | 13aa232c6293c |
14 | 763b31a33539 |
15 | 374856e13bb6 |
hex | 1b6e697de2df |
30161030210271 has 64 divisors (see below), whose sum is σ = 50205192422400. Its totient is φ = 17794950801408.
The previous prime is 30161030210263. The next prime is 30161030210287. The reversal of 30161030210271 is 17201203016103.
30161030210271 is a `hidden beast` number, since 3 + 0 + 1 + 610 + 3 + 0 + 21 + 0 + 27 + 1 = 666.
It is not a de Polignac number, because 30161030210271 - 23 = 30161030210263 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30161030218271) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 23588746 + ... + 24834471.
It is an arithmetic number, because the mean of its divisors is an integer number (784456131600).
Almost surely, 230161030210271 is an apocalyptic number.
30161030210271 is a deficient number, since it is larger than the sum of its proper divisors (20044162212129).
30161030210271 is a wasteful number, since it uses less digits than its factorization.
30161030210271 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48423325 (or 48423319 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 27.
Adding to 30161030210271 its reverse (17201203016103), we get a palindrome (47362233226374).
The spelling of 30161030210271 in words is "thirty trillion, one hundred sixty-one billion, thirty million, two hundred ten thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •