Base | Representation |
---|---|
bin | 101111110000010111110100… |
… | …110011111111010011011000 |
3 | 1000112122220002022200021222210 |
4 | 233300113310303333103120 |
5 | 210012132124032323112 |
6 | 2022411301420115120 |
7 | 62145222160022625 |
oct | 5760276463772330 |
9 | 1015586068607883 |
10 | 210032303011032 |
11 | 60a172215786a7 |
12 | 1b681801395aa0 |
13 | 9026c65969cc8 |
14 | 39c1890db134c |
15 | 194364edc4b3c |
hex | bf05f4cff4d8 |
210032303011032 has 64 divisors (see below), whose sum is σ = 528310804337280. Its totient is φ = 69580108899072.
The previous prime is 210032303010977. The next prime is 210032303011043. The reversal of 210032303011032 is 230110303230012.
It is a super-2 number, since 2×2100323030110322 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 256441323 + ... + 257259045.
It is an arithmetic number, because the mean of its divisors is an integer number (8254856317770).
Almost surely, 2210032303011032 is an apocalyptic number.
It is an amenable number.
210032303011032 is an abundant number, since it is smaller than the sum of its proper divisors (318278501326248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210032303011032 is a wasteful number, since it uses less digits than its factorization.
210032303011032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 883552 (or 883548 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 210032303011032 its reverse (230110303230012), we get a palindrome (440142606241044).
The spelling of 210032303011032 in words is "two hundred ten trillion, thirty-two billion, three hundred three million, eleven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •