Base | Representation |
---|---|
bin | 10010001110011001101… |
… | …010100101110111111001 |
3 | 11102201200212001221201212 |
4 | 102032121222211313321 |
5 | 131004420332443421 |
6 | 2355203441052505 |
7 | 156324655426523 |
oct | 22163152456771 |
9 | 4381625057655 |
10 | 1252413562361 |
11 | 443166895285 |
12 | 182886927135 |
13 | 911433b1530 |
14 | 4488d608a13 |
15 | 228a13d4e5b |
hex | 12399aa5df9 |
1252413562361 has 4 divisors (see below), whose sum is σ = 1348753067172. Its totient is φ = 1156074057552.
The previous prime is 1252413562349. The next prime is 1252413562441. The reversal of 1252413562361 is 1632653142521.
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 128482818025 + 1123930744336 = 358445^2 + 1060156^2 .
It is a cyclic number.
It is not a de Polignac number, because 1252413562361 - 238 = 977535655417 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1252413562061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 48169752386 + ... + 48169752411.
It is an arithmetic number, because the mean of its divisors is an integer number (337188266793).
Almost surely, 21252413562361 is an apocalyptic number.
It is an amenable number.
1252413562361 is a deficient number, since it is larger than the sum of its proper divisors (96339504811).
1252413562361 is an equidigital number, since it uses as much as digits as its factorization.
1252413562361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96339504810.
The product of its digits is 259200, while the sum is 41.
The spelling of 1252413562361 in words is "one trillion, two hundred fifty-two billion, four hundred thirteen million, five hundred sixty-two thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •