Base | Representation |
---|---|
bin | 101101100001010011101110… |
… | …010001010101100000111101 |
3 | 222020212000210211021201201211 |
4 | 231201103232101111200331 |
5 | 202220043133324420013 |
6 | 1545443024210204421 |
7 | 60112021510550341 |
oct | 5541235621254075 |
9 | 866760724251654 |
10 | 200201013123133 |
11 | 588768557509a0 |
12 | 1a55436a283711 |
13 | 8792b4a4614a9 |
14 | 3761ad04ab621 |
15 | 1822a4b43823d |
hex | b614ee45583d |
200201013123133 has 16 divisors (see below), whose sum is σ = 219159759329280. Its totient is φ = 181368964954800.
The previous prime is 200201013123131. The next prime is 200201013123283. The reversal of 200201013123133 is 331321310102002.
200201013123133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 200201013123133 - 21 = 200201013123131 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200201013123131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9276198 + ... + 22055608.
It is an arithmetic number, because the mean of its divisors is an integer number (13697484958080).
Almost surely, 2200201013123133 is an apocalyptic number.
It is an amenable number.
200201013123133 is a deficient number, since it is larger than the sum of its proper divisors (18958746206147).
200201013123133 is a wasteful number, since it uses less digits than its factorization.
200201013123133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12784368.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 200201013123133 its reverse (331321310102002), we get a palindrome (531522323225135).
The spelling of 200201013123133 in words is "two hundred trillion, two hundred one billion, thirteen million, one hundred twenty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •