Base | Representation |
---|---|
bin | 11101010010111000101… |
… | …100010010011011100101 |
3 | 21010110021102022021200011 |
4 | 131102320230102123211 |
5 | 230440404141441401 |
6 | 4140454131450221 |
7 | 265305365546155 |
oct | 35227054223345 |
9 | 7113242267604 |
10 | 2013143312101 |
11 | 706850a0a799 |
12 | 2861b1756971 |
13 | 117ab9532b1c |
14 | 6d618282765 |
15 | 37576cdc451 |
hex | 1d4b8b126e5 |
2013143312101 has 4 divisors (see below), whose sum is σ = 2033075424204. Its totient is φ = 1993211200000.
The previous prime is 2013143312083. The next prime is 2013143312123. The reversal of 2013143312101 is 1012133413102.
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 1107543655201 + 905599656900 = 1052399^2 + 951630^2 .
It is a cyclic number.
It is not a de Polignac number, because 2013143312101 - 223 = 2013134923493 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 (2013143312171) 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, 9966055900 + ... + 9966056101.
It is an arithmetic number, because the mean of its divisors is an integer number (508268856051).
Almost surely, 22013143312101 is an apocalyptic number.
It is an amenable number.
2013143312101 is a deficient number, since it is larger than the sum of its proper divisors (19932112103).
2013143312101 is a wasteful number, since it uses less digits than its factorization.
2013143312101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19932112102.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 2013143312101 its reverse (1012133413102), we get a palindrome (3025276725203).
The spelling of 2013143312101 in words is "two trillion, thirteen billion, one hundred forty-three million, three hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •