Base | Representation |
---|---|
bin | 11100111110000… |
… | …11100010111101 |
3 | 121221021210112022 |
4 | 32133003202331 |
5 | 444203201023 |
6 | 40040445525 |
7 | 6010436663 |
oct | 1637034275 |
9 | 557253468 |
10 | 243022013 |
11 | 1151a8043 |
12 | 694798a5 |
13 | 3b46b510 |
14 | 243c0c33 |
15 | 165067c8 |
hex | e7c38bd |
243022013 has 16 divisors (see below), whose sum is σ = 267560496. Its totient is φ = 219348480.
The previous prime is 243021983. The next prime is 243022019. The reversal of 243022013 is 310220342.
It can be written as a sum of positive squares in 8 ways, for example, as 6416089 + 236605924 = 2533^2 + 15382^2 .
It is not a de Polignac number, because 243022013 - 26 = 243021949 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 243021982 and 243022000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (243022019) 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 15 ways as a sum of consecutive naturals, for example, 358631 + ... + 359307.
It is an arithmetic number, because the mean of its divisors is an integer number (16722531).
Almost surely, 2243022013 is an apocalyptic number.
It is an amenable number.
243022013 is a deficient number, since it is larger than the sum of its proper divisors (24538483).
243022013 is a wasteful number, since it uses less digits than its factorization.
243022013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1264.
The product of its (nonzero) digits is 288, while the sum is 17.
The square root of 243022013 is about 15589.1633194344. The cubic root of 243022013 is about 624.0439895092.
Adding to 243022013 its reverse (310220342), we get a palindrome (553242355).
The spelling of 243022013 in words is "two hundred forty-three million, twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •