Base | Representation |
---|---|
bin | 111111100010011… |
… | …1110100100100101 |
3 | 12111120202101200112 |
4 | 1333010332210211 |
5 | 13331243330201 |
6 | 551320222405 |
7 | 103555540250 |
oct | 17704764445 |
9 | 5446671615 |
10 | 2132011301 |
11 | 9a4512712 |
12 | 4b600aa05 |
13 | 27c918464 |
14 | 163220097 |
15 | c728c0bb |
hex | 7f13e925 |
2132011301 has 4 divisors (see below), whose sum is σ = 2436584352. Its totient is φ = 1827438252.
The previous prime is 2132011283. The next prime is 2132011303. The reversal of 2132011301 is 1031102312.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2132011301 - 26 = 2132011237 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 (2132011303) 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, 152286515 + ... + 152286528.
It is an arithmetic number, because the mean of its divisors is an integer number (609146088).
Almost surely, 22132011301 is an apocalyptic number.
It is an amenable number.
2132011301 is a deficient number, since it is larger than the sum of its proper divisors (304573051).
2132011301 is an equidigital number, since it uses as much as digits as its factorization.
2132011301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 304573050.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 2132011301 is about 46173.7078974604. The cubic root of 2132011301 is about 1287.0532061535.
Adding to 2132011301 its reverse (1031102312), we get a palindrome (3163113613).
It can be divided in two parts, 2132011 and 301, that added together give a palindrome (2132312).
The spelling of 2132011301 in words is "two billion, one hundred thirty-two million, eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •