Base | Representation |
---|---|
bin | 10001011011011… |
… | …01101000101011 |
3 | 101012002210020201 |
4 | 20231231220223 |
5 | 244411414011 |
6 | 22301333031 |
7 | 3423455236 |
oct | 1055555053 |
9 | 335083221 |
10 | 146201131 |
11 | 7558808a |
12 | 40b67177 |
13 | 2439ba5b |
14 | 155ba41d |
15 | cc7dcc1 |
hex | 8b6da2b |
146201131 has 4 divisors (see below), whose sum is σ = 146295072. Its totient is φ = 146107192.
The previous prime is 146201129. The next prime is 146201149. The reversal of 146201131 is 131102641.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 146201131 - 21 = 146201129 is a prime.
It is a super-2 number, since 2×1462011312 = 42749541411358322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 146201099 and 146201108.
It is not an unprimeable number, because it can be changed into a prime (146201191) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44596 + ... + 47761.
It is an arithmetic number, because the mean of its divisors is an integer number (36573768).
Almost surely, 2146201131 is an apocalyptic number.
146201131 is a deficient number, since it is larger than the sum of its proper divisors (93941).
146201131 is an equidigital number, since it uses as much as digits as its factorization.
146201131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93940.
The product of its (nonzero) digits is 144, while the sum is 19.
The square root of 146201131 is about 12091.3659691534. The cubic root of 146201131 is about 526.8054316206.
Adding to 146201131 its reverse (131102641), we get a palindrome (277303772).
It can be divided in two parts, 14620 and 1131, that added together give a palindrome (15751).
The spelling of 146201131 in words is "one hundred forty-six million, two hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •