Base | Representation |
---|---|
bin | 1100001111001110001… |
… | …0011110101110010000 |
3 | 202002200021210200201010 |
4 | 3003303202132232100 |
5 | 11421040022114212 |
6 | 240330201410520 |
7 | 21122023224261 |
oct | 3036342365620 |
9 | 662607720633 |
10 | 210244332432 |
11 | 81189498842 |
12 | 348b6499a40 |
13 | 16a97816444 |
14 | a266886968 |
15 | 57079e703c |
hex | 30f389eb90 |
210244332432 has 40 divisors (see below), whose sum is σ = 543556003840. Its totient is φ = 70026629760.
The previous prime is 210244332383. The next prime is 210244332449. The reversal of 210244332432 is 234233442012.
210244332432 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 210244332432.
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, 1650919 + ... + 1773702.
It is an arithmetic number, because the mean of its divisors is an integer number (13588900096).
Almost surely, 2210244332432 is an apocalyptic number.
It is an amenable number.
210244332432 is an abundant number, since it is smaller than the sum of its proper divisors (333311671408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210244332432 is a wasteful number, since it uses less digits than its factorization.
210244332432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3425911 (or 3425905 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 30.
Adding to 210244332432 its reverse (234233442012), we get a palindrome (444477774444).
The spelling of 210244332432 in words is "two hundred ten billion, two hundred forty-four million, three hundred thirty-two thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •