Base | Representation |
---|---|
bin | 11111111000010001010100… |
… | …010001000011001011110001 |
3 | 200101102121000221022202202120 |
4 | 133320101110101003023301 |
5 | 121334120023444310012 |
6 | 1214105521432504453 |
7 | 41350400315541351 |
oct | 3770212421031361 |
9 | 611377027282676 |
10 | 140206326166257 |
11 | 40746194a4981a |
12 | 13884b12b4b129 |
13 | 6030527558400 |
14 | 268a045642b61 |
15 | 113214d02558c |
hex | 7f84544432f1 |
140206326166257 has 24 divisors (see below), whose sum is σ = 202641826441824. Its totient is φ = 86189706180864.
The previous prime is 140206326166229. The next prime is 140206326166339. The reversal of 140206326166257 is 752661623602041.
It is not a de Polignac number, because 140206326166257 - 223 = 140206317777649 is a prime.
It is a super-2 number, since 2×1402063261662572 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (140206326166217) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 145528888 + ... + 146489145.
It is an arithmetic number, because the mean of its divisors is an integer number (8443409435076).
Almost surely, 2140206326166257 is an apocalyptic number.
It is an amenable number.
140206326166257 is a deficient number, since it is larger than the sum of its proper divisors (62435500275567).
140206326166257 is a wasteful number, since it uses less digits than its factorization.
140206326166257 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 292019009 (or 292018996 counting only the distinct ones).
The product of its (nonzero) digits is 4354560, while the sum is 51.
Adding to 140206326166257 its reverse (752661623602041), we get a palindrome (892867949768298).
The spelling of 140206326166257 in words is "one hundred forty trillion, two hundred six billion, three hundred twenty-six million, one hundred sixty-six thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •