Base | Representation |
---|---|
bin | 110000100110101010001010… |
… | …0000110100000011111101111 |
3 | 2002001202001111111110000112212 |
4 | 1201031110110012200133233 |
5 | 422014040041234031143 |
6 | 4113134330134121035 |
7 | 156023465551556330 |
oct | 14115242406403757 |
9 | 2061661444400485 |
10 | 427525676861423 |
11 | 11424a6920204a8 |
12 | 3bb494101b017b |
13 | 15472662b0b8aa |
14 | 77804d313c287 |
15 | 3465dcd61a918 |
hex | 184d5141a07ef |
427525676861423 has 4 divisors (see below), whose sum is σ = 488600773555920. Its totient is φ = 366450580166928.
The previous prime is 427525676861417. The next prime is 427525676861441. The reversal of 427525676861423 is 324168676525724.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 427525676861423 - 242 = 423127630350319 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 (427525676861453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30537548347238 + ... + 30537548347251.
It is an arithmetic number, because the mean of its divisors is an integer number (122150193388980).
Almost surely, 2427525676861423 is an apocalyptic number.
427525676861423 is a deficient number, since it is larger than the sum of its proper divisors (61075096694497).
427525676861423 is an equidigital number, since it uses as much as digits as its factorization.
427525676861423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61075096694496.
The product of its digits is 812851200, while the sum is 68.
The spelling of 427525676861423 in words is "four hundred twenty-seven trillion, five hundred twenty-five billion, six hundred seventy-six million, eight hundred sixty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •