Base | Representation |
---|---|
bin | 101101101101000111001000… |
… | …000000111111001011110101 |
3 | 222100201120102021012110221121 |
4 | 231231013020000333023311 |
5 | 202321340310222401401 |
6 | 1551303405420143541 |
7 | 60224434503360511 |
oct | 5555071000771365 |
9 | 870646367173847 |
10 | 201012120122101 |
11 | 59059841485382 |
12 | 1a6655b4397bb1 |
13 | 88214915598b2 |
14 | 378d0779d7141 |
15 | 1838bbe8a2ca1 |
hex | b6d1c803f2f5 |
201012120122101 has 4 divisors (see below), whose sum is σ = 201013122182400. Its totient is φ = 201011118061804.
The previous prime is 201012120122041. The next prime is 201012120122117. The reversal of 201012120122101 is 101221021210102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 201012120122101 - 235 = 200977760383733 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201012120122141) 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, 500729191 + ... + 501130468.
It is an arithmetic number, because the mean of its divisors is an integer number (50253280545600).
Almost surely, 2201012120122101 is an apocalyptic number.
It is an amenable number.
201012120122101 is a deficient number, since it is larger than the sum of its proper divisors (1002060299).
201012120122101 is a wasteful number, since it uses less digits than its factorization.
201012120122101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1002060298.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 201012120122101 its reverse (101221021210102), we get a palindrome (302233141332203).
The spelling of 201012120122101 in words is "two hundred one trillion, twelve billion, one hundred twenty million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •