Base | Representation |
---|---|
bin | 1000100001000001111… |
… | …1001000100011001001 |
3 | 111222122021120201001201 |
4 | 2020100133020203021 |
5 | 4344113201010001 |
6 | 151113430144201 |
7 | 13366405050334 |
oct | 2102037104311 |
9 | 458567521051 |
10 | 146305485001 |
11 | 570586a5375 |
12 | 244314b2061 |
13 | 10a48029300 |
14 | 711cc3b61b |
15 | 3c1459d501 |
hex | 22107c88c9 |
146305485001 has 9 divisors (see below), whose sum is σ = 158430850599. Its totient is φ = 135046626936.
The previous prime is 146305484987. The next prime is 146305485019. The reversal of 146305485001 is 100584503641.
It is a happy number.
The square root of 146305485001 is 382499.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 21642823225 + 124662661776 = 147115^2 + 353076^2 .
It is not a de Polignac number, because 146305485001 - 219 = 146304960713 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (146305485031) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 4957776 + ... + 4987198.
Almost surely, 2146305485001 is an apocalyptic number.
146305485001 is the 382499-th square number.
146305485001 is the 191250-th centered octagonal number.
It is an amenable number.
146305485001 is a deficient number, since it is larger than the sum of its proper divisors (12125365598).
146305485001 is an frugal number, since it uses more digits than its factorization.
146305485001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58872 (or 29436 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 37.
Adding to 146305485001 its reverse (100584503641), we get a palindrome (246889988642).
The spelling of 146305485001 in words is "one hundred forty-six billion, three hundred five million, four hundred eighty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •