Base | Representation |
---|---|
bin | 11110100100110101001… |
… | …011001011100101001110 |
3 | 21102212101102220121112110 |
4 | 132210311023023211032 |
5 | 233411104032144324 |
6 | 4245125112044450 |
7 | 304541662636143 |
oct | 36446513134516 |
9 | 7385342817473 |
10 | 2101131131214 |
11 | 7400a2824575 |
12 | 29b268693726 |
13 | 12319c50460b |
14 | 739a3c343ca |
15 | 399c669c329 |
hex | 1e9352cb94e |
2101131131214 has 8 divisors (see below), whose sum is σ = 4202262262440. Its totient is φ = 700377043736.
The previous prime is 2101131131161. The next prime is 2101131131219. The reversal of 2101131131214 is 4121311311012.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
2101131131214 is an admirable number.
It is a super-2 number, since 2×21011311312142 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101131131219) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 175094260929 + ... + 175094260940.
It is an arithmetic number, because the mean of its divisors is an integer number (525282782805).
Almost surely, 22101131131214 is an apocalyptic number.
2101131131214 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2101131131214 is a wasteful number, since it uses less digits than its factorization.
2101131131214 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 350188521874.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 2101131131214 its reverse (4121311311012), we get a palindrome (6222442442226).
The spelling of 2101131131214 in words is "two trillion, one hundred one billion, one hundred thirty-one million, one hundred thirty-one thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •