Search a number
-
+
15055563143 = 73206240591
BaseRepresentation
bin11100000010110000…
…11010100110000111
31102212020200211222202
432001120122212013
5221313211010033
610525540545115
71042043114045
oct160130324607
942766624882
1015055563143
116426522475
122b020b219b
13155c20165a
14a2b769395
155d1b3c8e8
hex38161a987

15055563143 has 4 divisors (see below), whose sum is σ = 15261803808. Its totient is φ = 14849322480.

The previous prime is 15055563119. The next prime is 15055563227. The reversal of 15055563143 is 34136555051.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 34136555051 = 151226069901.

It is a cyclic number.

It is not a de Polignac number, because 15055563143 - 216 = 15055497607 is a prime.

It is a super-3 number, since 3×150555631433 (a number of 32 digits) contains 333 as substring.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 15055563097 and 15055563106.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (15055563113) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 103120223 + ... + 103120368.

It is an arithmetic number, because the mean of its divisors is an integer number (3815450952).

Almost surely, 215055563143 is an apocalyptic number.

15055563143 is a deficient number, since it is larger than the sum of its proper divisors (206240665).

15055563143 is an equidigital number, since it uses as much as digits as its factorization.

15055563143 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 206240664.

The product of its (nonzero) digits is 135000, while the sum is 38.

The spelling of 15055563143 in words is "fifteen billion, fifty-five million, five hundred sixty-three thousand, one hundred forty-three".

Divisors: 1 73 206240591 15055563143