Search a number
-
+
153105012010 = 2540138180801
BaseRepresentation
bin1000111010010111000…
…1010001010100101010
3112122012011002110121101
42032211301101110222
510002024340341020
6154200243432014
714030041062256
oct2164561212452
9478164073541
10153105012010
1159a27873685
122580a68560a
131158c940882
1475a5cd1266
153eb14b800a
hex23a5c5152a

153105012010 has 16 divisors (see below), whose sum is σ = 276276283272. Its totient is φ = 61089280000.

The previous prime is 153105012007. The next prime is 153105012023. The reversal of 153105012010 is 10210501351.

It can be written as a sum of positive squares in 4 ways, for example, as 144767313289 + 8337698721 = 380483^2 + 91311^2 .

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

It is an unprimeable number.

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 7 ways as a sum of consecutive naturals, for example, 19086391 + ... + 19094410.

Almost surely, 2153105012010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 38181209.

The product of its (nonzero) digits is 150, while the sum is 19.

Adding to 153105012010 its reverse (10210501351), we get a palindrome (163315513361).

The spelling of 153105012010 in words is "one hundred fifty-three billion, one hundred five million, twelve thousand, ten".

Divisors: 1 2 5 10 401 802 2005 4010 38180801 76361602 190904005 381808010 15310501201 30621002402 76552506005 153105012010