Base | Representation |
---|---|
bin | 1000011101110110101… |
… | …1010101011001010011 |
3 | 111220102212120021200002 |
4 | 2013131223111121103 |
5 | 4340341434422311 |
6 | 150453055320215 |
7 | 13336314325436 |
oct | 2073553253123 |
9 | 456385507602 |
10 | 145453045331 |
11 | 567604a7880 |
12 | 24233b2006b |
13 | 10940545739 |
14 | 707b94181d |
15 | 3bb481893b |
hex | 21ddad5653 |
145453045331 has 8 divisors (see below), whose sum is σ = 160684608000. Its totient is φ = 130556242440.
The previous prime is 145453045321. The next prime is 145453045343. The reversal of 145453045331 is 133540354541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 145453045331 - 26 = 145453045267 is a prime.
It is a super-2 number, since 2×1454530453312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145453045321) 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, 83689031 + ... + 83690768.
It is an arithmetic number, because the mean of its divisors is an integer number (20085576000).
Almost surely, 2145453045331 is an apocalyptic number.
145453045331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
145453045331 is a deficient number, since it is larger than the sum of its proper divisors (15231562669).
145453045331 is a wasteful number, since it uses less digits than its factorization.
145453045331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167379889.
The product of its (nonzero) digits is 216000, while the sum is 38.
Adding to 145453045331 its reverse (133540354541), we get a palindrome (278993399872).
The spelling of 145453045331 in words is "one hundred forty-five billion, four hundred fifty-three million, forty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •