Base | Representation |
---|---|
bin | 10001011011101… |
… | …01000100000001 |
3 | 101012011022222110 |
4 | 20231311010001 |
5 | 244413402203 |
6 | 22302125533 |
7 | 3423643026 |
oct | 1055650401 |
9 | 335138873 |
10 | 146231553 |
11 | 755a8a26 |
12 | 40b808a9 |
13 | 243ac860 |
14 | 155c754d |
15 | cc87d03 |
hex | 8b75101 |
146231553 has 8 divisors (see below), whose sum is σ = 209973568. Its totient is φ = 89988624.
The previous prime is 146231551. The next prime is 146231563. The reversal of 146231553 is 355132641.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 146231553 - 21 = 146231551 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 146231553.
It is not an unprimeable number, because it can be changed into a prime (146231551) 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 7 ways as a sum of consecutive naturals, for example, 1874725 + ... + 1874802.
It is an arithmetic number, because the mean of its divisors is an integer number (26246696).
Almost surely, 2146231553 is an apocalyptic number.
146231553 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
146231553 is a deficient number, since it is larger than the sum of its proper divisors (63742015).
146231553 is a wasteful number, since it uses less digits than its factorization.
146231553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3749543.
The product of its digits is 10800, while the sum is 30.
The square root of 146231553 is about 12092.6239088132. The cubic root of 146231553 is about 526.8419688741.
The spelling of 146231553 in words is "one hundred forty-six million, two hundred thirty-one thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •