Base | Representation |
---|---|
bin | 101101110001010100010010… |
… | …100001101101000000101111 |
3 | 222101202012102001221221201212 |
4 | 231301110102201231000233 |
5 | 202341104210023134411 |
6 | 1552044244105425035 |
7 | 60254345506443125 |
oct | 5561242241550057 |
9 | 871665361857655 |
10 | 201301133021231 |
11 | 59160370754121 |
12 | 1a6b161219b17b |
13 | 8842800029189 |
14 | 379d053865915 |
15 | 18414876be68b |
hex | b7151286d02f |
201301133021231 has 2 divisors, whose sum is σ = 201301133021232. Its totient is φ = 201301133021230.
The previous prime is 201301133021179. The next prime is 201301133021411. The reversal of 201301133021231 is 132120331103102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201301133021231 - 222 = 201301128826927 is a prime.
It is a super-2 number, since 2×2013011330212312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201301133021197 and 201301133021206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201301133051231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100650566510615 + 100650566510616.
It is an arithmetic number, because the mean of its divisors is an integer number (100650566510616).
Almost surely, 2201301133021231 is an apocalyptic number.
201301133021231 is a deficient number, since it is larger than the sum of its proper divisors (1).
201301133021231 is an equidigital number, since it uses as much as digits as its factorization.
201301133021231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 201301133021231 its reverse (132120331103102), we get a palindrome (333421464124333).
The spelling of 201301133021231 in words is "two hundred one trillion, three hundred one billion, one hundred thirty-three million, twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •