Base | Representation |
---|---|
bin | 111100100100010001… |
… | …0101100110000110011 |
3 | 110102201112021012001000 |
4 | 1321020202230300303 |
5 | 4112333403342200 |
6 | 135430155213043 |
7 | 12253105251615 |
oct | 1711042546063 |
9 | 412645235030 |
10 | 130066074675 |
11 | 501849a9aa9 |
12 | 2125aa47183 |
13 | c35a79a784 |
14 | 641c188db5 |
15 | 35b3a66300 |
hex | 1e488acc33 |
130066074675 has 48 divisors (see below), whose sum is σ = 249324756480. Its totient is φ = 66352540320.
The previous prime is 130066074643. The next prime is 130066074689. The reversal of 130066074675 is 576470660031.
130066074675 is a `hidden beast` number, since 1 + 30 + 0 + 6 + 607 + 4 + 6 + 7 + 5 = 666.
It is not a de Polignac number, because 130066074675 - 25 = 130066074643 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 130066074675.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4173399 + ... + 4204448.
It is an arithmetic number, because the mean of its divisors is an integer number (5194265760).
Almost surely, 2130066074675 is an apocalyptic number.
130066074675 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
130066074675 is a deficient number, since it is larger than the sum of its proper divisors (119258681805).
130066074675 is a wasteful number, since it uses less digits than its factorization.
130066074675 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8377889 (or 8377878 counting only the distinct ones).
The product of its (nonzero) digits is 635040, while the sum is 45.
The spelling of 130066074675 in words is "one hundred thirty billion, sixty-six million, seventy-four thousand, six hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •