Base | Representation |
---|---|
bin | 11001010000110101… |
… | …11001111000001101 |
3 | 1022000020020222201120 |
4 | 30220122321320031 |
5 | 210234114341331 |
6 | 10121503031153 |
7 | 660050652261 |
oct | 145032717015 |
9 | 38006228646 |
10 | 13563043341 |
11 | 582aa91231 |
12 | 276629b4b9 |
13 | 1381c2b043 |
14 | 9294520a1 |
15 | 545abe796 |
hex | 3286b9e0d |
13563043341 has 16 divisors (see below), whose sum is σ = 18164251776. Its totient is φ = 9001976256.
The previous prime is 13563043271. The next prime is 13563043349. The reversal of 13563043341 is 14334036531.
13563043341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13563043341 - 225 = 13529488909 is a prime.
It is a super-2 number, since 2×135630433412 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13563043349) 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, 1520691 + ... + 1529583.
It is an arithmetic number, because the mean of its divisors is an integer number (1135265736).
Almost surely, 213563043341 is an apocalyptic number.
It is an amenable number.
13563043341 is a deficient number, since it is larger than the sum of its proper divisors (4601208435).
13563043341 is a wasteful number, since it uses less digits than its factorization.
13563043341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11092.
The product of its (nonzero) digits is 38880, while the sum is 33.
Adding to 13563043341 its reverse (14334036531), we get a palindrome (27897079872).
The spelling of 13563043341 in words is "thirteen billion, five hundred sixty-three million, forty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •