Base | Representation |
---|---|
bin | 101110110010010011111… |
… | …1100010000100100101101 |
3 | 211202201120012202111020201 |
4 | 1131210213330100210231 |
5 | 1320323110423300221 |
6 | 21402002032513501 |
7 | 1232366150310163 |
oct | 135444774204455 |
9 | 24681505674221 |
10 | 6430236150061 |
11 | 205a058741919 |
12 | 87a2810ab891 |
13 | 3784a3c66899 |
14 | 18332190d233 |
15 | b23ea0a5891 |
hex | 5d927f1092d |
6430236150061 has 2 divisors, whose sum is σ = 6430236150062. Its totient is φ = 6430236150060.
The previous prime is 6430236150031. The next prime is 6430236150113. The reversal of 6430236150061 is 1600516320346.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6097595587561 + 332640562500 = 2469331^2 + 576750^2 .
It is a cyclic number.
It is not a de Polignac number, because 6430236150061 - 217 = 6430236018989 is a prime.
It is a super-2 number, since 2×64302361500612 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 6430236150061.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6430236150031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3215118075030 + 3215118075031.
It is an arithmetic number, because the mean of its divisors is an integer number (3215118075031).
Almost surely, 26430236150061 is an apocalyptic number.
It is an amenable number.
6430236150061 is a deficient number, since it is larger than the sum of its proper divisors (1).
6430236150061 is an equidigital number, since it uses as much as digits as its factorization.
6430236150061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 77760, while the sum is 37.
The spelling of 6430236150061 in words is "six trillion, four hundred thirty billion, two hundred thirty-six million, one hundred fifty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •