Search a number
-
+
153154505013 = 351051501671
BaseRepresentation
bin1000111010100010111…
…0000100100100110101
3112122022121012222020120
42032220232010210311
510002130023130023
6154205212322153
714031211545606
oct2165056044465
9478277188216
10153154505013
1159a527a8494
1225823173359
1311599c7c283
1475ac6d5dad
153eb59e28e3
hex23a8b84935

153154505013 has 4 divisors (see below), whose sum is σ = 204206006688. Its totient is φ = 102103003340.

The previous prime is 153154505011. The next prime is 153154505033. The reversal of 153154505013 is 310505451351.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 153154505013 - 21 = 153154505011 is a prime.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (153154505011) 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 3 ways as a sum of consecutive naturals, for example, 25525750833 + ... + 25525750838.

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

Almost surely, 2153154505013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 51051501674.

The product of its (nonzero) digits is 22500, while the sum is 33.

Adding to 153154505013 its reverse (310505451351), we get a palindrome (463659956364).

The spelling of 153154505013 in words is "one hundred fifty-three billion, one hundred fifty-four million, five hundred five thousand, thirteen".

Divisors: 1 3 51051501671 153154505013