Base | Representation |
---|---|
bin | 110000100111101000101101… |
… | …0000100111011011111100101 |
3 | 2002002012220012100102020212121 |
4 | 1201033101122010323133211 |
5 | 422023240132134322023 |
6 | 4113320142302345541 |
7 | 156036262226543536 |
oct | 14117213204733745 |
9 | 2062186170366777 |
10 | 427659994839013 |
11 | 1142a1649017052 |
12 | 3bb6b456b8b2b1 |
13 | 1548221a458641 |
14 | 7786bd5c9068d |
15 | 34696405b4d5d |
hex | 184f45a13b7e5 |
427659994839013 has 2 divisors, whose sum is σ = 427659994839014. Its totient is φ = 427659994839012.
The previous prime is 427659994838851. The next prime is 427659994839029. The reversal of 427659994839013 is 310938499956724.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 217547809248004 + 210112185591009 = 14749502^2 + 14495247^2 .
It is a cyclic number.
It is not a de Polignac number, because 427659994839013 - 245 = 392475622750181 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (427659994839053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 213829997419506 + 213829997419507.
It is an arithmetic number, because the mean of its divisors is an integer number (213829997419507).
It is a 1-persistent number, because it is pandigital, but 2⋅427659994839013 = 855319989678026 is not.
Almost surely, 2427659994839013 is an apocalyptic number.
It is an amenable number.
427659994839013 is a deficient number, since it is larger than the sum of its proper divisors (1).
427659994839013 is an equidigital number, since it uses as much as digits as its factorization.
427659994839013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3174474240, while the sum is 79.
The spelling of 427659994839013 in words is "four hundred twenty-seven trillion, six hundred fifty-nine billion, nine hundred ninety-four million, eight hundred thirty-nine thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •