Base | Representation |
---|---|
bin | 10001100000110… |
… | …00010000000001 |
3 | 101020102021212121 |
4 | 20300120100001 |
5 | 300101244334 |
6 | 22324324241 |
7 | 3432425536 |
oct | 1060302001 |
9 | 336367777 |
10 | 146899969 |
11 | 75a15137 |
12 | 41243681 |
13 | 24584b78 |
14 | 1571cd8d |
15 | cd6adb4 |
hex | 8c18401 |
146899969 has 2 divisors, whose sum is σ = 146899970. Its totient is φ = 146899968.
The previous prime is 146899967. The next prime is 146899981. The reversal of 146899969 is 969998641.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111936400 + 34963569 = 10580^2 + 5913^2 .
It is a cyclic number.
It is not a de Polignac number, because 146899969 - 21 = 146899967 is a prime.
It is a super-2 number, since 2×1468999692 = 43159201784401922, which contains 22 as substring.
Together with 146899967, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (146899967) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73449984 + 73449985.
It is an arithmetic number, because the mean of its divisors is an integer number (73449985).
Almost surely, 2146899969 is an apocalyptic number.
It is an amenable number.
146899969 is a deficient number, since it is larger than the sum of its proper divisors (1).
146899969 is an equidigital number, since it uses as much as digits as its factorization.
146899969 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 7558272, while the sum is 61.
The square root of 146899969 is about 12120.2297420470. The cubic root of 146899969 is about 527.6434703303.
It can be divided in two parts, 14689 and 9969, that multiplied together give a palindrome (146434641).
The spelling of 146899969 in words is "one hundred forty-six million, eight hundred ninety-nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •