Base | Representation |
---|---|
bin | 10001101001010… |
… | …01001101001101 |
3 | 101022112002112001 |
4 | 20310221031031 |
5 | 300343033442 |
6 | 22404312301 |
7 | 3445063231 |
oct | 1064511515 |
9 | 338462461 |
10 | 148017997 |
11 | 76609126 |
12 | 416a2691 |
13 | 24886a1a |
14 | 159305c1 |
15 | cedc2b7 |
hex | 8d2934d |
148017997 has 18 divisors (see below), whose sum is σ = 161559978. Its totient is φ = 135580032.
The previous prime is 148017959. The next prime is 148018007. The reversal of 148017997 is 799710841.
It can be written as a sum of positive squares in 3 ways, for example, as 35212356 + 112805641 = 5934^2 + 10621^2 .
It is not a de Polignac number, because 148017997 - 27 = 148017869 is a prime.
It is a Smith number, since the sum of its digits (46) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (148017907) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 534223 + ... + 534499.
Almost surely, 2148017997 is an apocalyptic number.
148017997 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
148017997 is a deficient number, since it is larger than the sum of its proper divisors (13541981).
148017997 is an equidigital number, since it uses as much as digits as its factorization.
148017997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 397 (or 337 counting only the distinct ones).
The product of its (nonzero) digits is 127008, while the sum is 46.
The square root of 148017997 is about 12166.2647102552. The cubic root of 148017997 is about 528.9786870391.
The spelling of 148017997 in words is "one hundred forty-eight million, seventeen thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •