Base | Representation |
---|---|
bin | 11111000001000011110… |
… | …010101001101001110101 |
3 | 21112202121210112002102211 |
4 | 133001003302221221311 |
5 | 234410142412130401 |
6 | 4311100500333421 |
7 | 306664045450633 |
oct | 37010362515165 |
9 | 7482553462384 |
10 | 2131441130101 |
11 | 751a36a51328 |
12 | 2a51073a4271 |
13 | 125cbcb886ba |
14 | 7523b4d6353 |
15 | 3a69c60c951 |
hex | 1f043ca9a75 |
2131441130101 has 4 divisors (see below), whose sum is σ = 2132671045932. Its totient is φ = 2130211214272.
The previous prime is 2131441130089. The next prime is 2131441130111. The reversal of 2131441130101 is 1010311441312.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 339253827025 + 1792187303076 = 582455^2 + 1338726^2 .
It is a cyclic number.
It is not a de Polignac number, because 2131441130101 - 229 = 2130904259189 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 (2131441130111) 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, 614955316 + ... + 614958781.
It is an arithmetic number, because the mean of its divisors is an integer number (533167761483).
Almost surely, 22131441130101 is an apocalyptic number.
It is an amenable number.
2131441130101 is a deficient number, since it is larger than the sum of its proper divisors (1229915831).
2131441130101 is a wasteful number, since it uses less digits than its factorization.
2131441130101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1229915830.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 2131441130101 its reverse (1010311441312), we get a palindrome (3141752571413).
The spelling of 2131441130101 in words is "two trillion, one hundred thirty-one billion, four hundred forty-one million, one hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •