Base | Representation |
---|---|
bin | 10100110001001111100… |
… | …000011101001010111010 |
3 | 12001110000102020020212020 |
4 | 110301033200131022322 |
5 | 141341013320103201 |
6 | 3011401532255310 |
7 | 205054623521043 |
oct | 24611740351272 |
9 | 5043012206766 |
10 | 1427263050426 |
11 | 500331868624 |
12 | 1b0743611536 |
13 | a4789c49285 |
14 | 4d1193638ca |
15 | 271d6855a36 |
hex | 14c4f81d2ba |
1427263050426 has 8 divisors (see below), whose sum is σ = 2854526100864. Its totient is φ = 475754350140.
The previous prime is 1427263050413. The next prime is 1427263050439. The reversal of 1427263050426 is 6240503627241.
It is an interprime number because it is at equal distance from previous prime (1427263050413) and next prime (1427263050439).
It is a sphenic number, since it is the product of 3 distinct primes.
1427263050426 is an admirable number.
It is a super-2 number, since 2×14272630504262 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 118938587530 + ... + 118938587541.
It is an arithmetic number, because the mean of its divisors is an integer number (356815762608).
Almost surely, 21427263050426 is an apocalyptic number.
1427263050426 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1427263050426 is a wasteful number, since it uses less digits than its factorization.
1427263050426 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 237877175076.
The product of its (nonzero) digits is 483840, while the sum is 42.
Adding to 1427263050426 its reverse (6240503627241), we get a palindrome (7667766677667).
The spelling of 1427263050426 in words is "one trillion, four hundred twenty-seven billion, two hundred sixty-three million, fifty thousand, four hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •