Base | Representation |
---|---|
bin | 101011110110001100101… |
… | …010011100001001110111 |
3 | 101200001102100110111201200 |
4 | 223312030222130021313 |
5 | 343331343243310403 |
6 | 10224114100023543 |
7 | 430456135333605 |
oct | 53661452341167 |
9 | 11601370414650 |
10 | 3013132010103 |
11 | a61953516296 |
12 | 407b6b991bb3 |
13 | 18b1a2372297 |
14 | a5b9cdc6875 |
15 | 535a256eca3 |
hex | 2bd8ca9c277 |
3013132010103 has 24 divisors (see below), whose sum is σ = 4469255730576. Its totient is φ = 1955454912000.
The previous prime is 3013132010081. The next prime is 3013132010143. The reversal of 3013132010103 is 3010102313103.
It is a happy number.
3013132010103 is a `hidden beast` number, since 301 + 31 + 320 + 1 + 0 + 10 + 3 = 666.
It is not a de Polignac number, because 3013132010103 - 222 = 3013127815799 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3013132010143) 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 23 ways as a sum of consecutive naturals, for example, 28237473 + ... + 28343978.
It is an arithmetic number, because the mean of its divisors is an integer number (186218988774).
Almost surely, 23013132010103 is an apocalyptic number.
3013132010103 is a deficient number, since it is larger than the sum of its proper divisors (1456123720473).
3013132010103 is a wasteful number, since it uses less digits than its factorization.
3013132010103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56581615 (or 56581612 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 3013132010103 its reverse (3010102313103), we get a palindrome (6023234323206).
The spelling of 3013132010103 in words is "three trillion, thirteen billion, one hundred thirty-two million, ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •