Base | Representation |
---|---|
bin | 10010010001001000101… |
… | …100101111110100111101 |
3 | 11110000021111202120020211 |
4 | 102101020230233310331 |
5 | 131031424113441341 |
6 | 2400411102112421 |
7 | 156460514063152 |
oct | 22211054576475 |
9 | 4400244676224 |
10 | 1255350140221 |
11 | 444433477731 |
12 | 18336627b711 |
13 | 914c08bb278 |
14 | 44a8b622229 |
15 | 229c40ec181 |
hex | 12448b2fd3d |
1255350140221 has 4 divisors (see below), whose sum is σ = 1255391226172. Its totient is φ = 1255309054272.
The previous prime is 1255350140129. The next prime is 1255350140257. The reversal of 1255350140221 is 1220410535521.
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 129607920121 + 1125742220100 = 360011^2 + 1061010^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1255350140221 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1255350110221) 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, 20497110 + ... + 20558263.
It is an arithmetic number, because the mean of its divisors is an integer number (313847806543).
Almost surely, 21255350140221 is an apocalyptic number.
It is an amenable number.
1255350140221 is a deficient number, since it is larger than the sum of its proper divisors (41085951).
1255350140221 is an equidigital number, since it uses as much as digits as its factorization.
1255350140221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41085950.
The product of its (nonzero) digits is 12000, while the sum is 31.
Adding to 1255350140221 its reverse (1220410535521), we get a palindrome (2475760675742).
The spelling of 1255350140221 in words is "one trillion, two hundred fifty-five billion, three hundred fifty million, one hundred forty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •