Base | Representation |
---|---|
bin | 101100000000100010111… |
… | …101111010101111111001 |
3 | 101201010002201221102222211 |
4 | 230000202331322233321 |
5 | 344022122332230040 |
6 | 10233152432415121 |
7 | 431331401511220 |
oct | 54004275725771 |
9 | 11633081842884 |
10 | 3024243633145 |
11 | a66635764129 |
12 | 40a1510a74a1 |
13 | 18c25344c967 |
14 | a6534a31cb7 |
15 | 53a02d0c8ea |
hex | 2c022f7abf9 |
3024243633145 has 32 divisors (see below), whose sum is σ = 4328013030912. Its totient is φ = 1983533916672.
The previous prime is 3024243633143. The next prime is 3024243633221. The reversal of 3024243633145 is 5413363424203.
It is not a de Polignac number, because 3024243633145 - 21 = 3024243633143 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3024243633098 and 3024243633107.
It is not an unprimeable number, because it can be changed into a prime (3024243633143) 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 31 ways as a sum of consecutive naturals, for example, 33824119 + ... + 33913411.
It is an arithmetic number, because the mean of its divisors is an integer number (135250407216).
Almost surely, 23024243633145 is an apocalyptic number.
3024243633145 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
3024243633145 is a deficient number, since it is larger than the sum of its proper divisors (1303769397767).
3024243633145 is a wasteful number, since it uses less digits than its factorization.
3024243633145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131401.
The product of its (nonzero) digits is 622080, while the sum is 40.
The spelling of 3024243633145 in words is "three trillion, twenty-four billion, two hundred forty-three million, six hundred thirty-three thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •