Base | Representation |
---|---|
bin | 10010000111110100101… |
… | …011010001000101111101 |
3 | 11102001110121201210210112 |
4 | 102013310223101011331 |
5 | 130400434214001303 |
6 | 2352034531515405 |
7 | 155654642600630 |
oct | 22076453210575 |
9 | 4361417653715 |
10 | 1245350531453 |
11 | 4401719aa656 |
12 | 181435458b65 |
13 | 90589009bc2 |
14 | 443bd561c17 |
15 | 225db2ba0d8 |
hex | 121f4ad117d |
1245350531453 has 4 divisors (see below), whose sum is σ = 1423257750240. Its totient is φ = 1067443312668.
The previous prime is 1245350531429. The next prime is 1245350531471. The reversal of 1245350531453 is 3541350535421.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1245350531453 - 28 = 1245350531197 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1245350531453.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1245350531473) 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, 88953609383 + ... + 88953609396.
It is an arithmetic number, because the mean of its divisors is an integer number (355814437560).
Almost surely, 21245350531453 is an apocalyptic number.
It is an amenable number.
1245350531453 is a deficient number, since it is larger than the sum of its proper divisors (177907218787).
1245350531453 is an equidigital number, since it uses as much as digits as its factorization.
1245350531453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177907218786.
The product of its (nonzero) digits is 540000, while the sum is 41.
The spelling of 1245350531453 in words is "one trillion, two hundred forty-five billion, three hundred fifty million, five hundred thirty-one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •