Base | Representation |
---|---|
bin | 1000100000000000110… |
… | …0010011001001001001 |
3 | 111221221020011221002012 |
4 | 2020000030103021021 |
5 | 4343033210042301 |
6 | 151030342545305 |
7 | 13356545321153 |
oct | 2100014231111 |
9 | 457836157065 |
10 | 146032112201 |
11 | 56a28358338 |
12 | 24375a38235 |
13 | 10a034c2261 |
14 | 70d47d9ad3 |
15 | 3bea59debb |
hex | 2200313249 |
146032112201 has 8 divisors (see below), whose sum is σ = 147339822120. Its totient is φ = 144724672512.
The previous prime is 146032112173. The next prime is 146032112203. The reversal of 146032112201 is 102211230641.
It can be written as a sum of positive squares in 4 ways, for example, as 1707342400 + 144324769801 = 41320^2 + 379901^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 146032112201 - 230 = 144958370377 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (146032112203) 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, 1109381 + ... + 1234013.
It is an arithmetic number, because the mean of its divisors is an integer number (18417477765).
Almost surely, 2146032112201 is an apocalyptic number.
It is an amenable number.
146032112201 is a deficient number, since it is larger than the sum of its proper divisors (1307709919).
146032112201 is a wasteful number, since it uses less digits than its factorization.
146032112201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135115.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 146032112201 its reverse (102211230641), we get a palindrome (248243342842).
The spelling of 146032112201 in words is "one hundred forty-six billion, thirty-two million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •