Base | Representation |
---|---|
bin | 1000011101011000011… |
… | …1100010011101011111 |
3 | 111220010000220221121020 |
4 | 2013112013202131133 |
5 | 4340112003034101 |
6 | 150432325135223 |
7 | 13333214332566 |
oct | 2072607423537 |
9 | 456100827536 |
10 | 145326221151 |
11 | 566a5954a01 |
12 | 241b955a513 |
13 | 1092019c647 |
14 | 7068b6abdd |
15 | 3ba8616136 |
hex | 21d61e275f |
145326221151 has 8 divisors (see below), whose sum is σ = 193805600304. Its totient is φ = 96865494720.
The previous prime is 145326221149. The next prime is 145326221153. The reversal of 145326221151 is 151122623541.
It is an interprime number because it is at equal distance from previous prime (145326221149) and next prime (145326221153).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 145326221151 - 21 = 145326221149 is a prime.
It is a super-2 number, since 2×1453262211512 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145326221153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4644990 + ... + 4676171.
It is an arithmetic number, because the mean of its divisors is an integer number (24225700038).
Almost surely, 2145326221151 is an apocalyptic number.
145326221151 is a deficient number, since it is larger than the sum of its proper divisors (48479379153).
145326221151 is an equidigital number, since it uses as much as digits as its factorization.
145326221151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9326361.
The product of its digits is 14400, while the sum is 33.
Adding to 145326221151 its reverse (151122623541), we get a palindrome (296448844692).
The spelling of 145326221151 in words is "one hundred forty-five billion, three hundred twenty-six million, two hundred twenty-one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •