Base | Representation |
---|---|
bin | 10010010000110110111… |
… | …100001111111011111101 |
3 | 11102222111202011100022211 |
4 | 102100312330033323331 |
5 | 131030321331322023 |
6 | 2400321340340421 |
7 | 156450235541503 |
oct | 22206674177375 |
9 | 4388452140284 |
10 | 1255052214013 |
11 | 4442a028a324 |
12 | 1832a2544711 |
13 | 91473c68380 |
14 | 44a5dc2c673 |
15 | 229a7d9ca0d |
hex | 12436f0fefd |
1255052214013 has 8 divisors (see below), whose sum is σ = 1383027127328. Its totient is φ = 1131567648624.
The previous prime is 1255052214007. The next prime is 1255052214023. The reversal of 1255052214013 is 3104122505521.
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 1255052214013 - 225 = 1255018659581 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 (1255052214023) 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, 1122586395 + ... + 1122587512.
It is an arithmetic number, because the mean of its divisors is an integer number (172878390916).
Almost surely, 21255052214013 is an apocalyptic number.
1255052214013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1255052214013 is a deficient number, since it is larger than the sum of its proper divisors (127974913315).
1255052214013 is a wasteful number, since it uses less digits than its factorization.
1255052214013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2245173963.
The product of its (nonzero) digits is 12000, while the sum is 31.
Adding to 1255052214013 its reverse (3104122505521), we get a palindrome (4359174719534).
The spelling of 1255052214013 in words is "one trillion, two hundred fifty-five billion, fifty-two million, two hundred fourteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •