Search a number
-
+
15145949951 = 111376904541
BaseRepresentation
bin11100001101100010…
…01101101011111111
31110002112202222101022
432012301031223333
5222004330344301
610542530134355
71044221310326
oct160661155377
943075688338
1015145949951
116472548410
122b284213bb
131574b5a682
14a397770bd
155d9a43d1b
hex386c4daff

15145949951 has 4 divisors (see below), whose sum is σ = 16522854504. Its totient is φ = 13769045400.

The previous prime is 15145949939. The next prime is 15145949989. The reversal of 15145949951 is 15994954151.

It is a semiprime because it is the product of two primes.

It is not a de Polignac number, because 15145949951 - 26 = 15145949887 is a prime.

It is a super-3 number, since 3×151459499513 (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 = 15145949893 and 15145949902.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (15145949051) 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, 688452260 + ... + 688452281.

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

Almost surely, 215145949951 is an apocalyptic number.

15145949951 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

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

15145949951 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 1376904552.

The product of its digits is 1458000, while the sum is 53.

The spelling of 15145949951 in words is "fifteen billion, one hundred forty-five million, nine hundred forty-nine thousand, nine hundred fifty-one".

Divisors: 1 11 1376904541 15145949951