Base | Representation |
---|---|
bin | 1000011101101111110… |
… | …1000010000100001001 |
3 | 111220100212011020201111 |
4 | 2013123331002010021 |
5 | 4340312034132223 |
6 | 150450143450321 |
7 | 13335513466210 |
oct | 2073375020411 |
9 | 456325136644 |
10 | 145424130313 |
11 | 56746148570 |
12 | 242262b69a1 |
13 | 10937560567 |
14 | 7077b76077 |
15 | 3bb200630d |
hex | 21dbf42109 |
145424130313 has 8 divisors (see below), whose sum is σ = 181308006720. Its totient is φ = 113317504080.
The previous prime is 145424130283. The next prime is 145424130329. The reversal of 145424130313 is 313031424541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 145424130313 - 217 = 145423999241 is a prime.
It is a super-2 number, since 2×1454241303132 (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 (145424133313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 944312458 + ... + 944312611.
It is an arithmetic number, because the mean of its divisors is an integer number (22663500840).
Almost surely, 2145424130313 is an apocalyptic number.
It is an amenable number.
145424130313 is a deficient number, since it is larger than the sum of its proper divisors (35883876407).
145424130313 is a wasteful number, since it uses less digits than its factorization.
145424130313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1888625087.
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 145424130313 its reverse (313031424541), we get a palindrome (458455554854).
The spelling of 145424130313 in words is "one hundred forty-five billion, four hundred twenty-four million, one hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •