Base | Representation |
---|---|
bin | 10100110001010100000… |
… | …110111110000100100001 |
3 | 12001110012210111200100012 |
4 | 110301110012332010201 |
5 | 141341143101134041 |
6 | 3011413331134305 |
7 | 205056551663555 |
oct | 24612406760441 |
9 | 5043183450305 |
10 | 1427340255521 |
11 | 5003713aa994 |
12 | 1b0765444395 |
13 | a479cc3b46b |
14 | 4d1256dd865 |
15 | 271dd5063eb |
hex | 14c541be121 |
1427340255521 has 8 divisors (see below), whose sum is σ = 1437208704000. Its totient is φ = 1417496760160.
The previous prime is 1427340255511. The next prime is 1427340255527. The reversal of 1427340255521 is 1255520437241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1427340255521 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1427340255527) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6123476 + ... + 6352293.
It is an arithmetic number, because the mean of its divisors is an integer number (179651088000).
Almost surely, 21427340255521 is an apocalyptic number.
It is an amenable number.
1427340255521 is a deficient number, since it is larger than the sum of its proper divisors (9868448479).
1427340255521 is a wasteful number, since it uses less digits than its factorization.
1427340255521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12476559.
The product of its (nonzero) digits is 336000, while the sum is 41.
It can be divided in two parts, 1427340 and 255521, that added together give a palindrome (1682861).
The spelling of 1427340255521 in words is "one trillion, four hundred twenty-seven billion, three hundred forty million, two hundred fifty-five thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •