Base | Representation |
---|---|
bin | 10001011001001… |
… | …11000010011011 |
3 | 101011120002120210 |
4 | 20230213002123 |
5 | 244323140323 |
6 | 22251222203 |
7 | 3421142211 |
oct | 1054470233 |
9 | 334502523 |
10 | 145911963 |
11 | 753aa8aa |
12 | 40a47963 |
13 | 242ca252 |
14 | 15542cb1 |
15 | cc23293 |
hex | 8b2709b |
145911963 has 32 divisors (see below), whose sum is σ = 214156800. Its totient is φ = 88010496.
The previous prime is 145911937. The next prime is 145911971. The reversal of 145911963 is 369119541.
It is not a de Polignac number, because 145911963 - 28 = 145911707 is a prime.
It is not an unprimeable number, because it can be changed into a prime (145911263) 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 31 ways as a sum of consecutive naturals, for example, 169831 + ... + 170687.
It is an arithmetic number, because the mean of its divisors is an integer number (6692400).
Almost surely, 2145911963 is an apocalyptic number.
145911963 is a deficient number, since it is larger than the sum of its proper divisors (68244837).
145911963 is a wasteful number, since it uses less digits than its factorization.
145911963 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1011.
The product of its digits is 29160, while the sum is 39.
The square root of 145911963 is about 12079.4024272726. The cubic root of 145911963 is about 526.4578834267.
The spelling of 145911963 in words is "one hundred forty-five million, nine hundred eleven thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •