Base | Representation |
---|---|
bin | 10010000111001… |
… | …10100000011111 |
3 | 101120220022021012 |
4 | 21003212200133 |
5 | 302344022403 |
6 | 23024325435 |
7 | 3523314101 |
oct | 1103464037 |
9 | 346808235 |
10 | 151939103 |
11 | 78847108 |
12 | 42a7387b |
13 | 2562a6c4 |
14 | 16271571 |
15 | d513ed8 |
hex | 90e681f |
151939103 has 4 divisors (see below), whose sum is σ = 152205768. Its totient is φ = 151672440.
The previous prime is 151939097. The next prime is 151939147. The reversal of 151939103 is 301939151.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301939151 = 3169 ⋅95279.
It is a cyclic number.
It is not a de Polignac number, because 151939103 - 222 = 147744799 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 151939103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151939303) 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 3 ways as a sum of consecutive naturals, for example, 132476 + ... + 133617.
It is an arithmetic number, because the mean of its divisors is an integer number (38051442).
Almost surely, 2151939103 is an apocalyptic number.
151939103 is a deficient number, since it is larger than the sum of its proper divisors (266665).
151939103 is an equidigital number, since it uses as much as digits as its factorization.
151939103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 266664.
The product of its (nonzero) digits is 3645, while the sum is 32.
The square root of 151939103 is about 12326.3580590538. The cubic root of 151939103 is about 533.6090493229.
The spelling of 151939103 in words is "one hundred fifty-one million, nine hundred thirty-nine thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •