Base | Representation |
---|---|
bin | 100001000001011001000110… |
… | …110100000100110111111001 |
3 | 201001012222010212220120111022 |
4 | 201001121012310010313321 |
5 | 123013432010311003023 |
6 | 1232514144155312225 |
7 | 42406415553250142 |
oct | 4101310664046771 |
9 | 631188125816438 |
10 | 145231212203513 |
11 | 42303236134417 |
12 | 1435694714b675 |
13 | 6306324363bb7 |
14 | 27c132a188ac9 |
15 | 11bcbe54077c8 |
hex | 841646d04df9 |
145231212203513 has 4 divisors (see below), whose sum is σ = 145253483519988. Its totient is φ = 145208940887040.
The previous prime is 145231212203491. The next prime is 145231212203521. The reversal of 145231212203513 is 315302212132541.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 62861302534144 + 82369909669369 = 7928512^2 + 9075787^2 .
It is a cyclic number.
It is not a de Polignac number, because 145231212203513 - 214 = 145231212187129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145231212203573) 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, 11135648456 + ... + 11135661497.
It is an arithmetic number, because the mean of its divisors is an integer number (36313370879997).
Almost surely, 2145231212203513 is an apocalyptic number.
It is an amenable number.
145231212203513 is a deficient number, since it is larger than the sum of its proper divisors (22271316475).
145231212203513 is an equidigital number, since it uses as much as digits as its factorization.
145231212203513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22271316474.
The product of its (nonzero) digits is 43200, while the sum is 35.
The spelling of 145231212203513 in words is "one hundred forty-five trillion, two hundred thirty-one billion, two hundred twelve million, two hundred three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •