Base | Representation |
---|---|
bin | 1000100001110011101… |
… | …0010110000111110011 |
3 | 112000011210211120112012 |
4 | 2020130322112013303 |
5 | 4400030032220300 |
6 | 151150234153135 |
7 | 13404515661551 |
oct | 2103472260763 |
9 | 460153746465 |
10 | 146513945075 |
11 | 57155336523 |
12 | 2448b2827ab |
13 | 10a7c286274 |
14 | 713c7c2bd1 |
15 | 3c27a29435 |
hex | 221ce961f3 |
146513945075 has 24 divisors (see below), whose sum is σ = 189603507456. Its totient is φ = 112098932000.
The previous prime is 146513945059. The next prime is 146513945089. The reversal of 146513945075 is 570549315641.
146513945075 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 146513945075 - 24 = 146513945059 is a prime.
It is a super-2 number, since 2×1465139450752 (a number of 23 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (50) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5374730 + ... + 5401920.
It is an arithmetic number, because the mean of its divisors is an integer number (7900146144).
Almost surely, 2146513945075 is an apocalyptic number.
146513945075 is a deficient number, since it is larger than the sum of its proper divisors (43089562381).
146513945075 is a wasteful number, since it uses less digits than its factorization.
146513945075 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36595 (or 36590 counting only the distinct ones).
The product of its (nonzero) digits is 2268000, while the sum is 50.
The spelling of 146513945075 in words is "one hundred forty-six billion, five hundred thirteen million, nine hundred forty-five thousand, seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •