Base | Representation |
---|---|
bin | 1000011110011100001… |
… | …0111000101110101001 |
3 | 111220211211022021222111 |
4 | 2013213002320232221 |
5 | 4341202203324223 |
6 | 150520432122321 |
7 | 13343233254154 |
oct | 2074702705651 |
9 | 456754267874 |
10 | 145610214313 |
11 | 568311961a3 |
12 | 242786963a1 |
13 | 10966c84735 |
14 | 7094774c9b |
15 | 3bc351230d |
hex | 21e70b8ba9 |
145610214313 has 8 divisors (see below), whose sum is σ = 146748925440. Its totient is φ = 144475423920.
The previous prime is 145610214293. The next prime is 145610214331. The reversal of 145610214313 is 313412016541.
145610214313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145610214313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145610214413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 905595 + ... + 1054192.
It is an arithmetic number, because the mean of its divisors is an integer number (18343615680).
Almost surely, 2145610214313 is an apocalyptic number.
It is an amenable number.
145610214313 is a deficient number, since it is larger than the sum of its proper divisors (1138711127).
145610214313 is a wasteful number, since it uses less digits than its factorization.
145610214313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1960367.
The product of its (nonzero) digits is 8640, while the sum is 31.
The spelling of 145610214313 in words is "one hundred forty-five billion, six hundred ten million, two hundred fourteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •