Base | Representation |
---|---|
bin | 11101010010111101100… |
… | …000111100000101111101 |
3 | 21010110111001112222200212 |
4 | 131102331200330011331 |
5 | 230441040400114401 |
6 | 4140510142002205 |
7 | 265310400355250 |
oct | 35227540740575 |
9 | 7113431488625 |
10 | 2013224223101 |
11 | 706892653393 |
12 | 286214876365 |
13 | 117b00221a60 |
14 | 6d624d05097 |
15 | 3757de70dbb |
hex | 1d4bd83c17d |
2013224223101 has 16 divisors (see below), whose sum is σ = 2479414224000. Its totient is φ = 1591852264128.
The previous prime is 2013224223091. The next prime is 2013224223113. The reversal of 2013224223101 is 1013224223102.
It is not a de Polignac number, because 2013224223101 - 234 = 1996044353917 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 (2013224223181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7000211 + ... + 7282128.
It is an arithmetic number, because the mean of its divisors is an integer number (154963389000).
Almost surely, 22013224223101 is an apocalyptic number.
It is an amenable number.
2013224223101 is a deficient number, since it is larger than the sum of its proper divisors (466190000899).
2013224223101 is a wasteful number, since it uses less digits than its factorization.
2013224223101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14283908.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 2013224223101 its reverse (1013224223102), we get a palindrome (3026448446203).
Subtracting from 2013224223101 its reverse (1013224223102), we obtain a palindrome (999999999999).
The spelling of 2013224223101 in words is "two trillion, thirteen billion, two hundred twenty-four million, two hundred twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •