Base | Representation |
---|---|
bin | 10001101000110… |
… | …11110101011111 |
3 | 101022102022101200 |
4 | 20310123311133 |
5 | 300334310411 |
6 | 22403210543 |
7 | 3444444453 |
oct | 1064336537 |
9 | 338368350 |
10 | 147963231 |
11 | 76580a69 |
12 | 41676a53 |
13 | 24867b10 |
14 | 15918663 |
15 | cecae56 |
hex | 8d1bd5f |
147963231 has 12 divisors (see below), whose sum is σ = 230165208. Its totient is φ = 91054224.
The previous prime is 147963199. The next prime is 147963251. The reversal of 147963231 is 132369741.
147963231 is a `hidden beast` number, since 14 + 7 + 9 + 632 + 3 + 1 = 666.
It is not a de Polignac number, because 147963231 - 25 = 147963199 is a prime.
It is a super-2 number, since 2×1479632312 = 43786235455918722, which contains 22 as substring.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (147963251) 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 11 ways as a sum of consecutive naturals, for example, 632205 + ... + 632438.
It is an arithmetic number, because the mean of its divisors is an integer number (19180434).
Almost surely, 2147963231 is an apocalyptic number.
147963231 is a deficient number, since it is larger than the sum of its proper divisors (82201977).
147963231 is a wasteful number, since it uses less digits than its factorization.
147963231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1264662 (or 1264659 counting only the distinct ones).
The product of its digits is 27216, while the sum is 36.
The square root of 147963231 is about 12164.0137701336. The cubic root of 147963231 is about 528.9134390715.
The spelling of 147963231 in words is "one hundred forty-seven million, nine hundred sixty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •