Base | Representation |
---|---|
bin | 1000100000000000001… |
… | …1110011100000110101 |
3 | 111221221001222210121112 |
4 | 2020000003303200311 |
5 | 4343032122313433 |
6 | 151030223124405 |
7 | 13356520355252 |
oct | 2100003634065 |
9 | 457831883545 |
10 | 146029885493 |
11 | 56a27077388 |
12 | 24375143705 |
13 | 10a02bc288b |
14 | 70d43ba429 |
15 | 3bea2ae348 |
hex | 22000f3835 |
146029885493 has 8 divisors (see below), whose sum is σ = 153735681120. Its totient is φ = 138326091120.
The previous prime is 146029885487. The next prime is 146029885499. The reversal of 146029885493 is 394588920641.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (146029885487) and next prime (146029885499).
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 146029885493 - 26 = 146029885429 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146029885499) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 349355 + ... + 643512.
It is an arithmetic number, because the mean of its divisors is an integer number (19216960140).
Almost surely, 2146029885493 is an apocalyptic number.
It is an amenable number.
146029885493 is a deficient number, since it is larger than the sum of its proper divisors (7705795627).
146029885493 is an equidigital number, since it uses as much as digits as its factorization.
146029885493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000627.
The product of its (nonzero) digits is 14929920, while the sum is 59.
The spelling of 146029885493 in words is "one hundred forty-six billion, twenty-nine million, eight hundred eighty-five thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •