Base | Representation |
---|---|
bin | 1000101011101011101… |
… | …1110000101000111001 |
3 | 112021000120111000021111 |
4 | 2022322323300220321 |
5 | 4420442232202321 |
6 | 152305302040321 |
7 | 13530310365001 |
oct | 2127273605071 |
9 | 467016430244 |
10 | 149165115961 |
11 | 58295901444 |
12 | 24aab1190a1 |
13 | 110b2604534 |
14 | 7310945001 |
15 | 3d306665e1 |
hex | 22baef0a39 |
149165115961 has 3 divisors (see below), whose sum is σ = 149165502181. Its totient is φ = 149164729742.
The previous prime is 149165115959. The next prime is 149165116043. The reversal of 149165115961 is 169511561941.
The square root of 149165115961 is 386219.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is not a de Polignac number, because 149165115961 - 21 = 149165115959 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (149165115901) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 193110 + ... + 579328.
Almost surely, 2149165115961 is an apocalyptic number.
149165115961 is the 386219-th square number.
149165115961 is the 193110-th centered octagonal number.
It is an amenable number.
149165115961 is a deficient number, since it is larger than the sum of its proper divisors (386220).
149165115961 is an frugal number, since it uses more digits than its factorization.
149165115961 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 772438 (or 386219 counting only the distinct ones).
The product of its digits is 291600, while the sum is 49.
Multiplying 149165115961 by its sum of digits (49), we get a square (7309090682089 = 27035332).
The spelling of 149165115961 in words is "one hundred forty-nine billion, one hundred sixty-five million, one hundred fifteen thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •