Base | Representation |
---|---|
bin | 10001011110100010100… |
… | …011001100110100100101 |
3 | 11020211001100200111210201 |
4 | 101132202203030310211 |
5 | 124134143342342013 |
6 | 2315424203150501 |
7 | 152525320106500 |
oct | 21364243146445 |
9 | 4224040614721 |
10 | 1201023012133 |
11 | 4233951a826a |
12 | 174924215431 |
13 | 89343521329 |
14 | 421b6346137 |
15 | 213949153dd |
hex | 117a28ccd25 |
1201023012133 has 24 divisors (see below), whose sum is σ = 1456284177312. Its totient is φ = 986675637024.
The previous prime is 1201023012131. The next prime is 1201023012151. The reversal of 1201023012133 is 3312103201021.
It is not a de Polignac number, because 1201023012133 - 21 = 1201023012131 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1201023012133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201023012131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4822191 + ... + 5065132.
It is an arithmetic number, because the mean of its divisors is an integer number (60678507388).
Almost surely, 21201023012133 is an apocalyptic number.
It is an amenable number.
1201023012133 is a deficient number, since it is larger than the sum of its proper divisors (255261165179).
1201023012133 is an equidigital number, since it uses as much as digits as its factorization.
1201023012133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9887441 (or 9887434 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1201023012133 its reverse (3312103201021), we get a palindrome (4513126213154).
The spelling of 1201023012133 in words is "one trillion, two hundred one billion, twenty-three million, twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •