Base | Representation |
---|---|
bin | 1001010010010011100101… |
… | …1000100101110010000000 |
3 | 1100011002001102110121112101 |
4 | 2110210321120211302000 |
5 | 2314240241100310422 |
6 | 33414242153240144 |
7 | 2102440540100032 |
oct | 224447130456200 |
9 | 40132042417471 |
10 | 10210100010112 |
11 | 3287096308312 |
12 | 118a951a03054 |
13 | 590a67ab0132 |
14 | 274258767c52 |
15 | 12a8c4e2cc27 |
hex | 94939625c80 |
10210100010112 has 32 divisors (see below), whose sum is σ = 21224800298880. Its totient is φ = 4883091307776.
The previous prime is 10210100010001. The next prime is 10210100010139. The reversal of 10210100010112 is 21101000101201.
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×102101000101122 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1734049368 + ... + 1734055255.
It is an arithmetic number, because the mean of its divisors is an integer number (663275009340).
Almost surely, 210210100010112 is an apocalyptic number.
It is an amenable number.
10210100010112 is an abundant number, since it is smaller than the sum of its proper divisors (11014700288768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10210100010112 is an equidigital number, since it uses as much as digits as its factorization.
10210100010112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3468104660 (or 3468104648 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10210100010112 its reverse (21101000101201), we get a palindrome (31311100111313).
The spelling of 10210100010112 in words is "ten trillion, two hundred ten billion, one hundred million, ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •