Base | Representation |
---|---|
bin | 10000011100100101001… |
… | …111001010010001110101 |
3 | 11000001020122211010201212 |
4 | 100130211033022101311 |
5 | 122004122442130401 |
6 | 2223112432331205 |
7 | 144440303045351 |
oct | 20344517122165 |
9 | 4001218733655 |
10 | 1130201130101 |
11 | 3a635208a04a |
12 | 16305a0a3b05 |
13 | 82767a31b64 |
14 | 3c9b850a461 |
15 | 1e5ec0a8dbb |
hex | 107253ca475 |
1130201130101 has 8 divisors (see below), whose sum is σ = 1181427072000. Its totient is φ = 1079898178320.
The previous prime is 1130201130083. The next prime is 1130201130131. The reversal of 1130201130101 is 1010311020311.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1130201130101 - 222 = 1130196935797 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130201130131) 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 7 ways as a sum of consecutive naturals, for example, 230745026 + ... + 230749923.
It is an arithmetic number, because the mean of its divisors is an integer number (147678384000).
Almost surely, 21130201130101 is an apocalyptic number.
It is an amenable number.
1130201130101 is a deficient number, since it is larger than the sum of its proper divisors (51225941899).
1130201130101 is an equidigital number, since it uses as much as digits as its factorization.
1130201130101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 461495059.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 1130201130101 its reverse (1010311020311), we get a palindrome (2140512150412).
The spelling of 1130201130101 in words is "one trillion, one hundred thirty billion, two hundred one million, one hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •