Base | Representation |
---|---|
bin | 10010100001000… |
… | …01011110100001 |
3 | 101211021101201111 |
4 | 21100201132201 |
5 | 304230420434 |
6 | 23225103321 |
7 | 3564152362 |
oct | 1120413641 |
9 | 354241644 |
10 | 155326369 |
11 | 7a750000 |
12 | 44027b41 |
13 | 262453c3 |
14 | 168b3b69 |
15 | d982964 |
hex | 94217a1 |
155326369 has 15 divisors (see below), whose sum is σ = 172532865. Its totient is φ = 139834860.
The previous prime is 155326361. The next prime is 155326393. The reversal of 155326369 is 963623551.
It is a happy number.
The square root of 155326369 is 12463.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 155326369 - 23 = 155326361 is a prime.
It is a super-2 number, since 2×1553263692 = 48252561813448322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (155326361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 1507972 + ... + 1508074.
It is an arithmetic number, because the mean of its divisors is an integer number (11502191).
Almost surely, 2155326369 is an apocalyptic number.
155326369 is the 12463-rd square number.
155326369 is the 6232-nd centered octagonal number.
It is an amenable number.
155326369 is a deficient number, since it is larger than the sum of its proper divisors (17206496).
155326369 is an frugal number, since it uses more digits than its factorization.
155326369 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250 (or 114 counting only the distinct ones).
The product of its digits is 145800, while the sum is 40.
The cubic root of 155326369 is about 537.5452930284.
The spelling of 155326369 in words is "one hundred fifty-five million, three hundred twenty-six thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.440 sec. • engine limits •