Base | Representation |
---|---|
bin | 101000000011110001… |
… | …101111011111111111 |
3 | 11010000122122001010222 |
4 | 220003301233133333 |
5 | 1201042314403343 |
6 | 31432050451555 |
7 | 3051621562202 |
oct | 500361573777 |
9 | 133018561128 |
10 | 43013044223 |
11 | 17272818836 |
12 | 8404b93bbb |
13 | 4096383176 |
14 | 212080b939 |
15 | 11bb2a5a68 |
hex | a03c6f7ff |
43013044223 has 4 divisors (see below), whose sum is σ = 43013550120. Its totient is φ = 43012538328.
The previous prime is 43013044187. The next prime is 43013044229. The reversal of 43013044223 is 32244031034.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 43013044223 - 28 = 43013043967 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 43013044192 and 43013044201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (43013044229) 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 3 ways as a sum of consecutive naturals, for example, 90740 + ... + 307017.
It is an arithmetic number, because the mean of its divisors is an integer number (10753387530).
Almost surely, 243013044223 is an apocalyptic number.
43013044223 is a deficient number, since it is larger than the sum of its proper divisors (505897).
43013044223 is a wasteful number, since it uses less digits than its factorization.
43013044223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 505896.
The product of its (nonzero) digits is 6912, while the sum is 26.
Adding to 43013044223 its reverse (32244031034), we get a palindrome (75257075257).
The spelling of 43013044223 in words is "forty-three billion, thirteen million, forty-four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •