Base | Representation |
---|---|
bin | 10001011110110100011… |
… | …000001000100110001010 |
3 | 11020211211012110210202222 |
4 | 101132310120020212022 |
5 | 124140301424214010 |
6 | 2315514005454042 |
7 | 152535611243204 |
oct | 21366430104612 |
9 | 4224735423688 |
10 | 1201322101130 |
11 | 42352900a258 |
12 | 1749a8411322 |
13 | 89390490578 |
14 | 42203d5d774 |
15 | 213b0ce4355 |
hex | 117b460898a |
1201322101130 has 8 divisors (see below), whose sum is σ = 2162379782052. Its totient is φ = 480528840448.
The previous prime is 1201322101121. The next prime is 1201322101141. The reversal of 1201322101130 is 311012231021.
It can be written as a sum of positive squares in 2 ways, for example, as 1003689396649 + 197632704481 = 1001843^2 + 444559^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1201322101099 and 1201322101108.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 60066105047 + ... + 60066105066.
Almost surely, 21201322101130 is an apocalyptic number.
1201322101130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1201322101130 is a deficient number, since it is larger than the sum of its proper divisors (961057680922).
1201322101130 is a wasteful number, since it uses less digits than its factorization.
1201322101130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120132210120.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1201322101130 its reverse (311012231021), we get a palindrome (1512334332151).
The spelling of 1201322101130 in words is "one trillion, two hundred one billion, three hundred twenty-two million, one hundred one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •