Base | Representation |
---|---|
bin | 11110000101001110010000… |
… | …01110001111000010010100 |
3 | 22200012220002201120210121121 |
4 | 33002213020032033002110 |
5 | 32132301002012004000 |
6 | 352404543135453324 |
7 | 16635122252564053 |
oct | 1702471016170224 |
9 | 280186081523547 |
10 | 66150150500500 |
11 | 1a094137476990 |
12 | 7504413687244 |
13 | 2abac17703391 |
14 | 1249981c9239a |
15 | 79aab5947b1a |
hex | 3c29c838f094 |
66150150500500 has 48 divisors (see below), whose sum is σ = 157605740405568. Its totient is φ = 24054600180000.
The previous prime is 66150150500477. The next prime is 66150150500611. The reversal of 66150150500500 is 500505105166.
It is a super-2 number, since 2×661501505005002 (a number of 28 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (34) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6013644546 + ... + 6013655545.
It is an arithmetic number, because the mean of its divisors is an integer number (3283452925116).
Almost surely, 266150150500500 is an apocalyptic number.
It is an amenable number.
66150150500500 is an abundant number, since it is smaller than the sum of its proper divisors (91455589905068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66150150500500 is a wasteful number, since it uses less digits than its factorization.
66150150500500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12027300121 (or 12027300109 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 34.
Adding to 66150150500500 its reverse (500505105166), we get a palindrome (66650655605666).
The spelling of 66150150500500 in words is "sixty-six trillion, one hundred fifty billion, one hundred fifty million, five hundred thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •