Base | Representation |
---|---|
bin | 1100001111100011000… |
… | …1011010101010010000 |
3 | 202002220102000110212020 |
4 | 3003320301122222100 |
5 | 11421230011242112 |
6 | 240343015331440 |
7 | 21124140432516 |
oct | 3037061325220 |
9 | 662812013766 |
10 | 210332134032 |
11 | 81224008449 |
12 | 3491b980b80 |
13 | 16aaca78857 |
14 | a2743c04b6 |
15 | 571058c48c |
hex | 30f8c5aa90 |
210332134032 has 80 divisors (see below), whose sum is σ = 562189434240. Its totient is φ = 67681668096.
The previous prime is 210332133983. The next prime is 210332134037. The reversal of 210332134032 is 230431233012.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 210332133993 and 210332134011.
It is not an unprimeable number, because it can be changed into a prime (210332134037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12989013 + ... + 13005195.
It is an arithmetic number, because the mean of its divisors is an integer number (7027367928).
Almost surely, 2210332134032 is an apocalyptic number.
It is an amenable number.
210332134032 is an abundant number, since it is smaller than the sum of its proper divisors (351857300208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210332134032 is a wasteful number, since it uses less digits than its factorization.
210332134032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25560 (or 25554 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 210332134032 its reverse (230431233012), we get a palindrome (440763367044).
The spelling of 210332134032 in words is "two hundred ten billion, three hundred thirty-two million, one hundred thirty-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •