Base | Representation |
---|---|
bin | 1101111000001001011111… |
… | …11001000101110101001101 |
3 | 11000001100112120101010121102 |
4 | 12330010233321011311031 |
5 | 12444440341302231300 |
6 | 144523035135312445 |
7 | 6266514314154410 |
oct | 674045771056515 |
9 | 130040476333542 |
10 | 30516546133325 |
11 | 97a5aa38003aa |
12 | 350a38967b725 |
13 | 140490c52b755 |
14 | 777019ca5b77 |
15 | 37dc133300d5 |
hex | 1bc12fe45d4d |
30516546133325 has 24 divisors (see below), whose sum is σ = 43246562102400. Its totient is φ = 20925507412800.
The previous prime is 30516546133321. The next prime is 30516546133417. The reversal of 30516546133325 is 52333164561503.
It is not a de Polignac number, because 30516546133325 - 22 = 30516546133321 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30516546133325.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30516546133321) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 36649976 + ... + 37473374.
It is an arithmetic number, because the mean of its divisors is an integer number (1801940087600).
Almost surely, 230516546133325 is an apocalyptic number.
30516546133325 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
30516546133325 is a deficient number, since it is larger than the sum of its proper divisors (12730015969075).
30516546133325 is a wasteful number, since it uses less digits than its factorization.
30516546133325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1035197 (or 1035192 counting only the distinct ones).
The product of its (nonzero) digits is 2916000, while the sum is 47.
The spelling of 30516546133325 in words is "thirty trillion, five hundred sixteen billion, five hundred forty-six million, one hundred thirty-three thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •