Search a number
-
+
150320402013 = 31710927040907
BaseRepresentation
bin1000101111111111001…
…0110100111001011101
3112101000002100121210210
42023333302310321131
54430324010331023
6153020051523033
713601036222625
oct2137762647135
9471002317723
10150320402013
1158828a47a01
1225171bb9479
1311237a71652
1473c0155885
153d9bcbd593
hex22ffcb4e5d

150320402013 has 16 divisors (see below), whose sum is σ = 214163991360. Its totient is φ = 93453371136.

The previous prime is 150320402003. The next prime is 150320402017. The reversal of 150320402013 is 310204023051.

It is not a de Polignac number, because 150320402013 - 25 = 150320401981 is a prime.

It is a super-2 number, since 2×1503204020132 (a number of 23 digits) contains 22 as substring.

It is a Curzon number.

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13514895 + ... + 13526012.

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

Almost surely, 2150320402013 is an apocalyptic number.

It is an amenable number.

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

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

150320402013 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 27041036.

The product of its (nonzero) digits is 720, while the sum is 21.

Adding to 150320402013 its reverse (310204023051), we get a palindrome (460524425064).

The spelling of 150320402013 in words is "one hundred fifty billion, three hundred twenty million, four hundred two thousand, thirteen".

Divisors: 1 3 17 51 109 327 1853 5559 27040907 81122721 459695419 1379086257 2947458863 8842376589 50106800671 150320402013