Base | Representation |
---|---|
bin | 11111000000110111010… |
… | …001110101011011110101 |
3 | 21112202002011111120212102 |
4 | 133000313101311123311 |
5 | 234404230141413023 |
6 | 4311024001031445 |
7 | 306655616210525 |
oct | 37006721653365 |
9 | 7482064446772 |
10 | 2131231201013 |
11 | 7519394a7512 |
12 | 2a5069025585 |
13 | 125c88535bc5 |
14 | 7521b68b685 |
15 | 3a688e91628 |
hex | 1f0374756f5 |
2131231201013 has 8 divisors (see below), whose sum is σ = 2223976858368. Its totient is φ = 2038492496304.
The previous prime is 2131231201003. The next prime is 2131231201019. The reversal of 2131231201013 is 3101021321312.
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 2131231201013 - 24 = 2131231200997 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2131231201019) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1106870 + ... + 2342567.
It is an arithmetic number, because the mean of its divisors is an integer number (277997107296).
Almost surely, 22131231201013 is an apocalyptic number.
2131231201013 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2131231201013 is a deficient number, since it is larger than the sum of its proper divisors (92745657355).
2131231201013 is a wasteful number, since it uses less digits than its factorization.
2131231201013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3476323.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 2131231201013 its reverse (3101021321312), we get a palindrome (5232252522325).
The spelling of 2131231201013 in words is "two trillion, one hundred thirty-one billion, two hundred thirty-one million, two hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •