Base | Representation |
---|---|
bin | 101011110110001100000… |
… | …000011100111000000101 |
3 | 101200001101120202021211200 |
4 | 223312030000130320011 |
5 | 343331332434044023 |
6 | 10224113024053113 |
7 | 430455642641142 |
oct | 53661400347005 |
9 | 11601346667750 |
10 | 3013121003013 |
11 | a61948288520 |
12 | 407b68164199 |
13 | 18b19ccba204 |
14 | a5b9b75d3c9 |
15 | 535a15e8743 |
hex | 2bd8c01ce05 |
3013121003013 has 48 divisors (see below), whose sum is σ = 4795670655360. Its totient is φ = 1807791206400.
The previous prime is 3013121002973. The next prime is 3013121003033. The reversal of 3013121003013 is 3103001213103.
It is a happy number.
3013121003013 is a `hidden beast` number, since 301 + 312 + 10 + 0 + 30 + 13 = 666.
It is not a de Polignac number, because 3013121003013 - 217 = 3013120871941 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3013121003033) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 30960493 + ... + 31057661.
It is an arithmetic number, because the mean of its divisors is an integer number (99909805320).
Almost surely, 23013121003013 is an apocalyptic number.
3013121003013 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
3013121003013 is a deficient number, since it is larger than the sum of its proper divisors (1782549652347).
3013121003013 is a wasteful number, since it uses less digits than its factorization.
3013121003013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100330 (or 100327 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 3013121003013 its reverse (3103001213103), we get a palindrome (6116122216116).
The spelling of 3013121003013 in words is "three trillion, thirteen billion, one hundred twenty-one million, three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •