Base | Representation |
---|---|
bin | 101101101101000111000110… |
… | …110100010001100011000111 |
3 | 222100201120100212100210101121 |
4 | 231231013012310101203013 |
5 | 202321340240100342411 |
6 | 1551303403421134411 |
7 | 60224434140423244 |
oct | 5555070664214307 |
9 | 870646325323347 |
10 | 201012100012231 |
11 | 5905983109a552 |
12 | 1a6655a96ba407 |
13 | 882148a338471 |
14 | 378d0750805cb |
15 | 1838bbcc2e571 |
hex | b6d1c6d118c7 |
201012100012231 has 2 divisors, whose sum is σ = 201012100012232. Its totient is φ = 201012100012230.
The previous prime is 201012100012189. The next prime is 201012100012319. The reversal of 201012100012231 is 132210001210102.
201012100012231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201012100012231 - 215 = 201012099979463 is a prime.
It is a super-2 number, since 2×2010121000122312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201012100019231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100506050006115 + 100506050006116.
It is an arithmetic number, because the mean of its divisors is an integer number (100506050006116).
Almost surely, 2201012100012231 is an apocalyptic number.
201012100012231 is a deficient number, since it is larger than the sum of its proper divisors (1).
201012100012231 is an equidigital number, since it uses as much as digits as its factorization.
201012100012231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 201012100012231 its reverse (132210001210102), we get a palindrome (333222101222333).
The spelling of 201012100012231 in words is "two hundred one trillion, twelve billion, one hundred million, twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •