Base | Representation |
---|---|
bin | 10001010100111… |
… | …01110111010101 |
3 | 101010111112212002 |
4 | 20222131313111 |
5 | 244202200401 |
6 | 22231205045 |
7 | 3413312141 |
oct | 1052356725 |
9 | 333445762 |
10 | 145350101 |
11 | 75056756 |
12 | 40816785 |
13 | 241615a0 |
14 | 15438221 |
15 | cb61a6b |
hex | 8a9ddd5 |
145350101 has 4 divisors (see below), whose sum is σ = 156530892. Its totient is φ = 134169312.
The previous prime is 145350091. The next prime is 145350109. The reversal of 145350101 is 101053541.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 101053541 = 311 ⋅324931.
It can be written as a sum of positive squares in 2 ways, for example, as 95082001 + 50268100 = 9751^2 + 7090^2 .
It is a cyclic number.
It is not a de Polignac number, because 145350101 - 222 = 141155797 is a prime.
It is a super-2 number, since 2×1453501012 = 42253303721420402, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145350109) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5590376 + ... + 5590401.
It is an arithmetic number, because the mean of its divisors is an integer number (39132723).
Almost surely, 2145350101 is an apocalyptic number.
It is an amenable number.
145350101 is a deficient number, since it is larger than the sum of its proper divisors (11180791).
145350101 is a wasteful number, since it uses less digits than its factorization.
145350101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11180790.
The product of its (nonzero) digits is 300, while the sum is 20.
The square root of 145350101 is about 12056.1229671897. The cubic root of 145350101 is about 525.7812718556.
The spelling of 145350101 in words is "one hundred forty-five million, three hundred fifty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •