Base | Representation |
---|---|
bin | 10010100101111… |
… | …10011011001111 |
3 | 101212111001120012 |
4 | 21102332123033 |
5 | 304412003411 |
6 | 23250543435 |
7 | 3602500535 |
oct | 1122763317 |
9 | 355431505 |
10 | 155969231 |
11 | 80049aa0 |
12 | 44297b7b |
13 | 2640bbb2 |
14 | 16a00155 |
15 | da5d18b |
hex | 94be6cf |
155969231 has 8 divisors (see below), whose sum is σ = 170280144. Its totient is φ = 141680320.
The previous prime is 155969189. The next prime is 155969243. The reversal of 155969231 is 132969551.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 155969231 - 222 = 151774927 is a prime.
It is a super-2 number, since 2×1559692312 = 48652802037462722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155969251) by changing a digit.
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, 11675 + ... + 21171.
It is an arithmetic number, because the mean of its divisors is an integer number (21285018).
Almost surely, 2155969231 is an apocalyptic number.
155969231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
155969231 is a deficient number, since it is larger than the sum of its proper divisors (14310913).
155969231 is a wasteful number, since it uses less digits than its factorization.
155969231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11001.
The product of its digits is 72900, while the sum is 41.
The square root of 155969231 is about 12488.7641902632. The cubic root of 155969231 is about 538.2858665592.
The spelling of 155969231 in words is "one hundred fifty-five million, nine hundred sixty-nine thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •