Base | Representation |
---|---|
bin | 11110000100101000110011… |
… | …01111001011001010110010 |
3 | 22200010222012102020211001000 |
4 | 33002110121233023022302 |
5 | 32131433312033102201 |
6 | 352351420015422430 |
7 | 16633511056032345 |
oct | 1702243157131262 |
9 | 280128172224030 |
10 | 66130043253426 |
11 | 1a086659456619 |
12 | 7500541824a16 |
13 | 2ab9061a48449 |
14 | 12489d565045c |
15 | 79a2da594d86 |
hex | 3c2519bcb2b2 |
66130043253426 has 32 divisors (see below), whose sum is σ = 147349634699520. Its totient is φ = 21984250297392.
The previous prime is 66130043253367. The next prime is 66130043253431. The reversal of 66130043253426 is 62435234003166.
66130043253426 is a `hidden beast` number, since 6 + 6 + 130 + 0 + 43 + 2 + 53 + 426 = 666.
66130043253426 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 1641575610 + ... + 1641615893.
It is an arithmetic number, because the mean of its divisors is an integer number (4604676084360).
Almost surely, 266130043253426 is an apocalyptic number.
66130043253426 is an abundant number, since it is smaller than the sum of its proper divisors (81219591446094).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66130043253426 is a wasteful number, since it uses less digits than its factorization.
66130043253426 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3283191887 (or 3283191881 counting only the distinct ones).
The product of its (nonzero) digits is 1866240, while the sum is 45.
The spelling of 66130043253426 in words is "sixty-six trillion, one hundred thirty billion, forty-three million, two hundred fifty-three thousand, four hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •