Base | Representation |
---|---|
bin | 10111001100011100011010… |
… | …011101100011001011110010 |
3 | 111101012002012002012221200221 |
4 | 113030130122131203023302 |
5 | 101332313403310414302 |
6 | 1000542502230403254 |
7 | 30325665104004544 |
oct | 2714343235431362 |
9 | 441162162187627 |
10 | 102010212201202 |
11 | 2a55a319428968 |
12 | b53631980052a |
13 | 44bc6a2334506 |
14 | 1b2946baa1694 |
15 | bbd7be0c4937 |
hex | 5cc71a7632f2 |
102010212201202 has 48 divisors (see below), whose sum is σ = 158043082802400. Its totient is φ = 49366725056000.
The previous prime is 102010212201199. The next prime is 102010212201229. The reversal of 102010212201202 is 202102212010201.
It is a happy number.
102010212201202 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1020102122012022 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 215228802 + ... + 215702242.
It is an arithmetic number, because the mean of its divisors is an integer number (3292564225050).
Almost surely, 2102010212201202 is an apocalyptic number.
102010212201202 is a deficient number, since it is larger than the sum of its proper divisors (56032870601198).
102010212201202 is a wasteful number, since it uses less digits than its factorization.
102010212201202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 473883 (or 473782 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 102010212201202 its reverse (202102212010201), we get a palindrome (304112424211403).
It can be divided in two parts, 102010 and 212201202, that added together give a palindrome (212303212).
The spelling of 102010212201202 in words is "one hundred two trillion, ten billion, two hundred twelve million, two hundred one thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •