Base | Representation |
---|---|
bin | 10001011001010… |
… | …00110011010111 |
3 | 101011120110111111 |
4 | 20230220303113 |
5 | 244323403231 |
6 | 22251315451 |
7 | 3421202245 |
oct | 1054506327 |
9 | 334513444 |
10 | 145919191 |
11 | 75405280 |
12 | 40a4bb87 |
13 | 24300622 |
14 | 15545795 |
15 | cc254b1 |
hex | 8b28cd7 |
145919191 has 4 divisors (see below), whose sum is σ = 159184584. Its totient is φ = 132653800.
The previous prime is 145919171. The next prime is 145919219. The reversal of 145919191 is 191919541.
145919191 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 191919541 = 11 ⋅17447231.
It is a cyclic number.
It is not a de Polignac number, because 145919191 - 211 = 145917143 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 (145919141) 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, 6632680 + ... + 6632701.
It is an arithmetic number, because the mean of its divisors is an integer number (39796146).
Almost surely, 2145919191 is an apocalyptic number.
145919191 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
145919191 is a deficient number, since it is larger than the sum of its proper divisors (13265393).
145919191 is a wasteful number, since it uses less digits than its factorization.
145919191 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13265392.
The product of its digits is 14580, while the sum is 40.
The square root of 145919191 is about 12079.7016105531. The cubic root of 145919191 is about 526.4665762820.
The spelling of 145919191 in words is "one hundred forty-five million, nine hundred nineteen thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •