Base | Representation |
---|---|
bin | 101101110001010100001011… |
… | …010001011111100000111101 |
3 | 222101202012002120222110022012 |
4 | 231301110023101133200331 |
5 | 202341103432400044013 |
6 | 1552044224041301005 |
7 | 60254342501212400 |
oct | 5561241321374075 |
9 | 871665076873265 |
10 | 201301011331133 |
11 | 59160308a9859a |
12 | 1a6b1599494765 |
13 | 88427b0a5cbbc |
14 | 379d041629d37 |
15 | 184147bb831a8 |
hex | b7150b45f83d |
201301011331133 has 24 divisors (see below), whose sum is σ = 234222176208384. Its totient is φ = 172502691530400.
The previous prime is 201301011330971. The next prime is 201301011331177. The reversal of 201301011331133 is 331133110103102.
It is not a de Polignac number, because 201301011331133 - 216 = 201301011265597 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201301011331099 and 201301011331108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201301011331193) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6043062548 + ... + 6043095858.
It is an arithmetic number, because the mean of its divisors is an integer number (9759257342016).
Almost surely, 2201301011331133 is an apocalyptic number.
It is an amenable number.
201301011331133 is a deficient number, since it is larger than the sum of its proper divisors (32921164877251).
201301011331133 is a wasteful number, since it uses less digits than its factorization.
201301011331133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58953 (or 58946 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 201301011331133 its reverse (331133110103102), we get a palindrome (532434121434235).
The spelling of 201301011331133 in words is "two hundred one trillion, three hundred one billion, eleven million, three hundred thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •