Base | Representation |
---|---|
bin | 111011111111111… |
… | …0010101101101101 |
3 | 12012022012201222221 |
4 | 1313333302231231 |
5 | 13110340232001 |
6 | 531434035341 |
7 | 100614005200 |
oct | 16777625555 |
9 | 5168181887 |
10 | 2013211501 |
11 | 943450664 |
12 | 482278b51 |
13 | 261121912 |
14 | 151537937 |
15 | bbb221a1 |
hex | 77ff2b6d |
2013211501 has 6 divisors (see below), whose sum is σ = 2341899150. Its totient is φ = 1725609816.
The previous prime is 2013211469. The next prime is 2013211531. The reversal of 2013211501 is 1051123102.
It can be written as a sum of positive squares in only one way, i.e., 1452753225 + 560458276 = 38115^2 + 23674^2 .
It is not a de Polignac number, because 2013211501 - 25 = 2013211469 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 (2013211531) 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 5 ways as a sum of consecutive naturals, for example, 20542926 + ... + 20543023.
It is an arithmetic number, because the mean of its divisors is an integer number (390316525).
Almost surely, 22013211501 is an apocalyptic number.
It is an amenable number.
2013211501 is a deficient number, since it is larger than the sum of its proper divisors (328687649).
2013211501 is an equidigital number, since it uses as much as digits as its factorization.
2013211501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41085963 (or 41085956 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 16.
The square root of 2013211501 is about 44868.8254916484. The cubic root of 2013211501 is about 1262.6892049342.
Adding to 2013211501 its reverse (1051123102), we get a palindrome (3064334603).
The spelling of 2013211501 in words is "two billion, thirteen million, two hundred eleven thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •