Base | Representation |
---|---|
bin | 10100110000101111111… |
… | …000100111010001010101 |
3 | 12001101122102221010102112 |
4 | 110300233320213101111 |
5 | 141333422010343331 |
6 | 3011233141120405 |
7 | 205035522154553 |
oct | 24605770472125 |
9 | 5041572833375 |
10 | 1426732512341 |
11 | 50008a3434a4 |
12 | 1b06159b9105 |
13 | a4704061306 |
14 | 4d0a8adcbd3 |
15 | 271a4ea932b |
hex | 14c2fe27455 |
1426732512341 has 8 divisors (see below), whose sum is σ = 1437222460800. Its totient is φ = 1416274497792.
The previous prime is 1426732512313. The next prime is 1426732512377. The reversal of 1426732512341 is 1432152376241.
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 1426732512341 - 26 = 1426732512277 is a prime.
It is a super-4 number, since 4×14267325123414 (a number of 50 digits) contains 4444 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1426732512641) 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, 7893791 + ... + 8072508.
It is an arithmetic number, because the mean of its divisors is an integer number (179652807600).
Almost surely, 21426732512341 is an apocalyptic number.
It is an amenable number.
1426732512341 is a deficient number, since it is larger than the sum of its proper divisors (10489948459).
1426732512341 is a wasteful number, since it uses less digits than its factorization.
1426732512341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15966955.
The product of its digits is 241920, while the sum is 41.
Adding to 1426732512341 its reverse (1432152376241), we get a palindrome (2858884888582).
The spelling of 1426732512341 in words is "one trillion, four hundred twenty-six billion, seven hundred thirty-two million, five hundred twelve thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •