Base | Representation |
---|---|
bin | 10010111000110100… |
… | …011100010001110011 |
3 | 1221100101120110100020 |
4 | 102320310130101303 |
5 | 313013314433433 |
6 | 13152232054523 |
7 | 1315400314245 |
oct | 227064342163 |
9 | 57311513306 |
10 | 20280624243 |
11 | 866797a190 |
12 | 3b1bb34443 |
13 | 1bb2880499 |
14 | da5694095 |
15 | 7da6edcb3 |
hex | 4b8d1c473 |
20280624243 has 8 divisors (see below), whose sum is σ = 29499089856. Its totient is φ = 12291287400.
The previous prime is 20280624229. The next prime is 20280624251. The reversal of 20280624243 is 34242608202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20280624243 - 24 = 20280624227 is a prime.
It is a super-2 number, since 2×202806242432 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 614564371 = 20280624243 / (2 + 0 + 2 + 8 + 0 + 6 + 2 + 4 + 2 + 4 + 3).
It is not an unprimeable number, because it can be changed into a prime (20280624253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 307282153 + ... + 307282218.
It is an arithmetic number, because the mean of its divisors is an integer number (3687386232).
Almost surely, 220280624243 is an apocalyptic number.
20280624243 is a deficient number, since it is larger than the sum of its proper divisors (9218465613).
20280624243 is a wasteful number, since it uses less digits than its factorization.
20280624243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 614564385.
The product of its (nonzero) digits is 36864, while the sum is 33.
The spelling of 20280624243 in words is "twenty billion, two hundred eighty million, six hundred twenty-four thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •