Base | Representation |
---|---|
bin | 1100011111010011000… |
… | …1100001111110100000 |
3 | 202111211001112110102111 |
4 | 3013310301201332200 |
5 | 12003404331204212 |
6 | 242322325525104 |
7 | 21333666046000 |
oct | 3076461417640 |
9 | 674731473374 |
10 | 214560022432 |
11 | 82aa35a2598 |
12 | 356bb873794 |
13 | 1730496a372 |
14 | a555ad6000 |
15 | 58ab829ea7 |
hex | 31f4c61fa0 |
214560022432 has 48 divisors (see below), whose sum is σ = 492612321600. Its totient is φ = 91954290624.
The previous prime is 214560022423. The next prime is 214560022463. The reversal of 214560022432 is 234220065412.
214560022432 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 214560022394 and 214560022403.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 9763078 + ... + 9785029.
It is an arithmetic number, because the mean of its divisors is an integer number (10262756700).
Almost surely, 2214560022432 is an apocalyptic number.
It is an amenable number.
214560022432 is an abundant number, since it is smaller than the sum of its proper divisors (278052299168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
214560022432 is an equidigital number, since it uses as much as digits as its factorization.
214560022432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19548138 (or 19548116 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 31.
Adding to 214560022432 its reverse (234220065412), we get a palindrome (448780087844).
The spelling of 214560022432 in words is "two hundred fourteen billion, five hundred sixty million, twenty-two thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •