Base | Representation |
---|---|
bin | 110001001001011101011011… |
… | …000000111000101011000100 |
3 | 1001100100011011000202022222101 |
4 | 301021131123000320223010 |
5 | 211312433100043031310 |
6 | 2043415534041241444 |
7 | 63346431125254630 |
oct | 6111353300705304 |
9 | 1040304130668871 |
10 | 216154346064580 |
11 | 629675a8248580 |
12 | 202b01b1193284 |
13 | 937c362553b91 |
14 | 3b53cd75abdc0 |
15 | 19eca0d37c43a |
hex | c4975b038ac4 |
216154346064580 has 48 divisors (see below), whose sum is σ = 565931378791296. Its totient is φ = 67372783188480.
The previous prime is 216154346064563. The next prime is 216154346064703. The reversal of 216154346064580 is 85460643451612.
It is a super-2 number, since 2×2161543460645802 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (55).
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, 70179980949 + ... + 70179984028.
It is an arithmetic number, because the mean of its divisors is an integer number (11790237058152).
Almost surely, 2216154346064580 is an apocalyptic number.
216154346064580 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
216154346064580 is an abundant number, since it is smaller than the sum of its proper divisors (349777032726716).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
216154346064580 is a wasteful number, since it uses less digits than its factorization.
216154346064580 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140359965004 (or 140359965002 counting only the distinct ones).
The product of its (nonzero) digits is 16588800, while the sum is 55.
The spelling of 216154346064580 in words is "two hundred sixteen trillion, one hundred fifty-four billion, three hundred forty-six million, sixty-four thousand, five hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •