Base | Representation |
---|---|
bin | 100001001110100000011101… |
… | …100111101110010011011001 |
3 | 201011102010102200121021102210 |
4 | 201032200131213232103121 |
5 | 123123213241320403031 |
6 | 1234444154410145333 |
7 | 42531502456141356 |
oct | 4116403547562331 |
9 | 634363380537383 |
10 | 146132464231641 |
11 | 426204804364a8 |
12 | 1448154a722249 |
13 | 637030332ca44 |
14 | 2812bc596562d |
15 | 11d63927ea746 |
hex | 84e81d9ee4d9 |
146132464231641 has 8 divisors (see below), whose sum is σ = 195193094056704. Its totient is φ = 97246738613840.
The previous prime is 146132464231553. The next prime is 146132464231643.
146132464231641 is nontrivially palindromic in base 10.
146132464231641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 146132464231641 - 211 = 146132464229593 is a prime.
It is not an unprimeable number, because it can be changed into a prime (146132464231643) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43726049865 + ... + 43726053206.
It is an arithmetic number, because the mean of its divisors is an integer number (24399136757088).
Almost surely, 2146132464231641 is an apocalyptic number.
It is an amenable number.
146132464231641 is a deficient number, since it is larger than the sum of its proper divisors (49060629825063).
146132464231641 is an equidigital number, since it uses as much as digits as its factorization.
146132464231641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87452103631.
The product of its digits is 1990656, while the sum is 48.
The spelling of 146132464231641 in words is "one hundred forty-six trillion, one hundred thirty-two billion, four hundred sixty-four million, two hundred thirty-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •