Base | Representation |
---|---|
bin | 1100001110110000111… |
… | …1111001010100100100 |
3 | 202002100202122120202221 |
4 | 3003230033321110210 |
5 | 11420312214121012 |
6 | 240310112042124 |
7 | 21116006462533 |
oct | 3035417712444 |
9 | 662322576687 |
10 | 210122020132 |
11 | 811264477a2 |
12 | 34881533344 |
13 | 16a7838cbbb |
14 | a25452831a |
15 | 56ebdd6507 |
hex | 30ec3f9524 |
210122020132 has 24 divisors (see below), whose sum is σ = 372198256416. Its totient is φ = 103780031808.
The previous prime is 210122020109. The next prime is 210122020133. The reversal of 210122020132 is 231020221012.
It is a happy number.
210122020132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2101220201322 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (210122020133) by changing a digit.
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, 2425183 + ... + 2510329.
It is an arithmetic number, because the mean of its divisors is an integer number (15508260684).
Almost surely, 2210122020132 is an apocalyptic number.
It is an amenable number.
210122020132 is a deficient number, since it is larger than the sum of its proper divisors (162076236284).
210122020132 is a wasteful number, since it uses less digits than its factorization.
210122020132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92667 (or 92665 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 210122020132 its reverse (231020221012), we get a palindrome (441142241144).
The spelling of 210122020132 in words is "two hundred ten billion, one hundred twenty-two million, twenty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •