Base | Representation |
---|---|
bin | 10001011110101111000… |
… | …100010111011110101011 |
3 | 11020211120222212200110012 |
4 | 101132233010113132223 |
5 | 124140111124030011 |
6 | 2315501104442135 |
7 | 152533450211555 |
oct | 21365704273653 |
9 | 4224528780405 |
10 | 1201233033131 |
11 | 42349280513a |
12 | 17498261934b |
13 | 89377ba6901 |
14 | 421d61b64d5 |
15 | 213a809da8b |
hex | 117af1177ab |
1201233033131 has 4 divisors (see below), whose sum is σ = 1201243524312. Its totient is φ = 1201222541952.
The previous prime is 1201233033109. The next prime is 1201233033137. The reversal of 1201233033131 is 1313303321021.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1201233033131 - 218 = 1201232770987 is a prime.
It is a super-2 number, since 2×12012330331312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1201233033097 and 1201233033106.
It is not an unprimeable number, because it can be changed into a prime (1201233033137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5071925 + ... + 5303478.
It is an arithmetic number, because the mean of its divisors is an integer number (300310881078).
Almost surely, 21201233033131 is an apocalyptic number.
1201233033131 is a deficient number, since it is larger than the sum of its proper divisors (10491181).
1201233033131 is a wasteful number, since it uses less digits than its factorization.
1201233033131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10491180.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 1201233033131 its reverse (1313303321021), we get a palindrome (2514536354152).
The spelling of 1201233033131 in words is "one trillion, two hundred one billion, two hundred thirty-three million, thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •