Base | Representation |
---|---|
bin | 11100100010111101… |
… | …010001110110110100 |
3 | 2221010010202100121110 |
4 | 130202331101312310 |
5 | 1000233210312330 |
6 | 22025254515020 |
7 | 2133365262021 |
oct | 344275216664 |
9 | 87103670543 |
10 | 30651260340 |
11 | 11aa9923618 |
12 | 5b35065a70 |
13 | 2b7629a94c |
14 | 16aab36548 |
15 | be5dbedb0 |
hex | 722f51db4 |
30651260340 has 48 divisors (see below), whose sum is σ = 85867891200. Its totient is φ = 8169444480.
The previous prime is 30651260309. The next prime is 30651260369. The reversal of 30651260340 is 4306215603.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 30651260298 and 30651260307.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14116 + ... + 247995.
It is an arithmetic number, because the mean of its divisors is an integer number (1788914400).
Almost surely, 230651260340 is an apocalyptic number.
30651260340 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
30651260340 is an abundant number, since it is smaller than the sum of its proper divisors (55216630860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30651260340 is a wasteful number, since it uses less digits than its factorization.
30651260340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264072 (or 264070 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 30.
Adding to 30651260340 its reverse (4306215603), we get a palindrome (34957475943).
The spelling of 30651260340 in words is "thirty billion, six hundred fifty-one million, two hundred sixty thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •