Base | Representation |
---|---|
bin | 1000100000101000110… |
… | …1110110110011001001 |
3 | 111222100221122101011010 |
4 | 2020022031312303021 |
5 | 4343404233330203 |
6 | 151055151354133 |
7 | 13363656660660 |
oct | 2101215666311 |
9 | 458327571133 |
10 | 146200292553 |
11 | 57004287767 |
12 | 24402222949 |
13 | 10a2c2b8263 |
14 | 710cc97dd7 |
15 | 3c0a220303 |
hex | 220a376cc9 |
146200292553 has 16 divisors (see below), whose sum is σ = 235886186880. Its totient is φ = 78628728576.
The previous prime is 146200292543. The next prime is 146200292561. The reversal of 146200292553 is 355292002641.
It is not a de Polignac number, because 146200292553 - 25 = 146200292521 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (146200292543) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 204761958 + ... + 204762671.
It is an arithmetic number, because the mean of its divisors is an integer number (14742886680).
Almost surely, 2146200292553 is an apocalyptic number.
It is an amenable number.
146200292553 is a deficient number, since it is larger than the sum of its proper divisors (89685894327).
146200292553 is a wasteful number, since it uses less digits than its factorization.
146200292553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 409524656.
The product of its (nonzero) digits is 129600, while the sum is 39.
The spelling of 146200292553 in words is "one hundred forty-six billion, two hundred million, two hundred ninety-two thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •