Search a number
-
+
148897049151 = 349632349717
BaseRepresentation
bin1000101010101011110…
…1001010101000111111
3112020022220001210202010
42022222331022220333
54414420121033101
6152222524302303
713520544015054
oct2125275125077
9466286053663
10148897049151
1158168558924
1224a353a1993
131106bc07616
1472c70c502b
153d16d642d6
hex22aaf4aa3f

148897049151 has 4 divisors (see below), whose sum is σ = 198529398872. Its totient is φ = 99264699432.

The previous prime is 148897049129. The next prime is 148897049153. The reversal of 148897049151 is 151940798841.

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

It is not a de Polignac number, because 148897049151 - 29 = 148897048639 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

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

Almost surely, 2148897049151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 49632349720.

The product of its (nonzero) digits is 2903040, while the sum is 57.

The spelling of 148897049151 in words is "one hundred forty-eight billion, eight hundred ninety-seven million, forty-nine thousand, one hundred fifty-one".

Divisors: 1 3 49632349717 148897049151