Base | Representation |
---|---|
bin | 10010001100100010110… |
… | …111000001001000100001 |
3 | 11102112112221110022101122 |
4 | 102030202313001020201 |
5 | 130441330101043131 |
6 | 2354233555142025 |
7 | 156224403305510 |
oct | 22144267011041 |
9 | 4375487408348 |
10 | 1250420331041 |
11 | 442333751072 |
12 | 18240b2a4915 |
13 | 90bb646700b |
14 | 447409d2677 |
15 | 227d640cd7b |
hex | 12322dc1221 |
1250420331041 has 8 divisors (see below), whose sum is σ = 1475150252544. Its totient is φ = 1037215020960.
The previous prime is 1250420331031. The next prime is 1250420331101. The reversal of 1250420331041 is 1401330240521.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1250420331041 - 234 = 1233240461857 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1250420331041.
It is not an unprimeable number, because it can be changed into a prime (1250420331031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2881152620 + ... + 2881153053.
It is an arithmetic number, because the mean of its divisors is an integer number (184393781568).
Almost surely, 21250420331041 is an apocalyptic number.
It is an amenable number.
1250420331041 is a deficient number, since it is larger than the sum of its proper divisors (224729921503).
1250420331041 is an equidigital number, since it uses as much as digits as its factorization.
1250420331041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5762305711.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 1250420331041 its reverse (1401330240521), we get a palindrome (2651750571562).
The spelling of 1250420331041 in words is "one trillion, two hundred fifty billion, four hundred twenty million, three hundred thirty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •