Base | Representation |
---|---|
bin | 11110001010001110001010… |
… | …01110001011100000000100 |
3 | 22200211022102011101202011210 |
4 | 33011013011032023200010 |
5 | 32143104222101034322 |
6 | 353015505410531420 |
7 | 16653412323462042 |
oct | 1705070516134004 |
9 | 280738364352153 |
10 | 66321898846212 |
11 | 1a14aa60988069 |
12 | 7531765896b70 |
13 | 2b01188933149 |
14 | 1253dd5bd7392 |
15 | 7a02b89e670c |
hex | 3c51c538b804 |
66321898846212 has 48 divisors (see below), whose sum is σ = 161516561818752. Its totient is φ = 21161151947520.
The previous prime is 66321898846211. The next prime is 66321898846243. The reversal of 66321898846212 is 21264889812366.
It is a Smith number, since the sum of its digits (66) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (66321898846211) by changing a digit.
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, 1271677768 + ... + 1271729919.
It is an arithmetic number, because the mean of its divisors is an integer number (3364928371224).
Almost surely, 266321898846212 is an apocalyptic number.
It is an amenable number.
66321898846212 is an abundant number, since it is smaller than the sum of its proper divisors (95194662972540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66321898846212 is a wasteful number, since it uses less digits than its factorization.
66321898846212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2543407788 (or 2543407786 counting only the distinct ones).
The product of its digits is 95551488, while the sum is 66.
The spelling of 66321898846212 in words is "sixty-six trillion, three hundred twenty-one billion, eight hundred ninety-eight million, eight hundred forty-six thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •