Base | Representation |
---|---|
bin | 101011110110010001111… |
… | …111111110000111011001 |
3 | 101200001122120221010002101 |
4 | 223312101333332013121 |
5 | 343332034203242223 |
6 | 10224131015003401 |
7 | 430461303331615 |
oct | 53662177760731 |
9 | 11601576833071 |
10 | 3013221540313 |
11 | a6199a0066a6 |
12 | 407b95969561 |
13 | 18b1b7a8b43a |
14 | a5baac50345 |
15 | 535aa3574ad |
hex | 2bd91ffe1d9 |
3013221540313 has 4 divisors (see below), whose sum is σ = 3028834087348. Its totient is φ = 2997608993280.
The previous prime is 3013221540299. The next prime is 3013221540359. The reversal of 3013221540313 is 3130451223103.
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 1946033370009 + 1067188170304 = 1395003^2 + 1033048^2 .
It is a cyclic number.
It is not a de Polignac number, because 3013221540313 - 225 = 3013187985881 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3013221540713) 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, 7806273228 + ... + 7806273613.
It is an arithmetic number, because the mean of its divisors is an integer number (757208521837).
Almost surely, 23013221540313 is an apocalyptic number.
It is an amenable number.
3013221540313 is a deficient number, since it is larger than the sum of its proper divisors (15612547035).
3013221540313 is a wasteful number, since it uses less digits than its factorization.
3013221540313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15612547034.
The product of its (nonzero) digits is 6480, while the sum is 28.
Adding to 3013221540313 its reverse (3130451223103), we get a palindrome (6143672763416).
The spelling of 3013221540313 in words is "three trillion, thirteen billion, two hundred twenty-one million, five hundred forty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •