Base | Representation |
---|---|
bin | 11101101000011111000111… |
… | …001101100000010110010010 |
3 | 122002102222222121022001111110 |
4 | 131220133013031200112102 |
5 | 114040223143411301012 |
6 | 1141102420231554150 |
7 | 36310465150350033 |
oct | 3550370715402622 |
9 | 562388877261443 |
10 | 130325534868882 |
11 | 38586826943451 |
12 | 12749b65b2b956 |
13 | 5794850690562 |
14 | 2427b0a718a8a |
15 | 10100ed87e73c |
hex | 7687c7360592 |
130325534868882 has 8 divisors (see below), whose sum is σ = 260651069737776. Its totient is φ = 43441844956292.
The previous prime is 130325534868827. The next prime is 130325534868889. The reversal of 130325534868882 is 288868435523031.
It is a sphenic number, since it is the product of 3 distinct primes.
130325534868882 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (130325534868889) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10860461239068 + ... + 10860461239079.
It is an arithmetic number, because the mean of its divisors is an integer number (32581383717222).
Almost surely, 2130325534868882 is an apocalyptic number.
130325534868882 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130325534868882 is a wasteful number, since it uses less digits than its factorization.
130325534868882 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21720922478152.
The product of its (nonzero) digits is 265420800, while the sum is 66.
The spelling of 130325534868882 in words is "one hundred thirty trillion, three hundred twenty-five billion, five hundred thirty-four million, eight hundred sixty-eight thousand, eight hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •