Base | Representation |
---|---|
bin | 101011110110001110000… |
… | …111111010010101001111 |
3 | 101200001111001120101112012 |
4 | 223312032013322111033 |
5 | 343331421031404403 |
6 | 10224120333131435 |
7 | 430456553526122 |
oct | 53661607722517 |
9 | 11601431511465 |
10 | 3013156513103 |
11 | a61966331800 |
12 | 407b78029b7b |
13 | 18b1a74711b9 |
14 | a5ba23643b9 |
15 | 535a47aeed8 |
hex | 2bd8e1fa54f |
3013156513103 has 24 divisors (see below), whose sum is σ = 3346727424768. Its totient is φ = 2710528040000.
The previous prime is 3013156513097. The next prime is 3013156513117.
3013156513103 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 3013156513103 - 218 = 3013156250959 is a prime.
It is a super-2 number, since 2×30131565131032 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3013156513103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3013156513123) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 21107858 + ... + 21250128.
It is an arithmetic number, because the mean of its divisors is an integer number (139446976032).
Almost surely, 23013156513103 is an apocalyptic number.
3013156513103 is a deficient number, since it is larger than the sum of its proper divisors (333570911665).
3013156513103 is a wasteful number, since it uses less digits than its factorization.
3013156513103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144127 (or 144116 counting only the distinct ones).
The product of its (nonzero) digits is 12150, while the sum is 32.
The spelling of 3013156513103 in words is "three trillion, thirteen billion, one hundred fifty-six million, five hundred thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •