Base | Representation |
---|---|
bin | 1100101010101111001110… |
… | …11011011100101000001001 |
3 | 10122122002010111111202011111 |
4 | 12111113213123130220021 |
5 | 12122401103341142401 |
6 | 135125113504130321 |
7 | 5603404061103064 |
oct | 625274733345011 |
9 | 118562114452144 |
10 | 27856745646601 |
11 | 896aa8576a273 |
12 | 315a9a79069a1 |
13 | 1270b590265c1 |
14 | 6c43b8db58db |
15 | 334940541e51 |
hex | 1955e76dca09 |
27856745646601 has 9 divisors (see below), whose sum is σ = 28519875139149. Its totient is φ = 27208692678636.
The previous prime is 27856745646593. The next prime is 27856745646629. The reversal of 27856745646601 is 10664654765872.
The square root of 27856745646601 is 5277949.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 27856745646601 - 23 = 27856745646593 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (27856745676601) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 226890436 + ... + 227013178.
It is an arithmetic number, because the mean of its divisors is an integer number (3168875015461).
Almost surely, 227856745646601 is an apocalyptic number.
27856745646601 is the 5277949-th square number.
27856745646601 is the 2638975-th centered octagonal number.
It is an amenable number.
27856745646601 is a deficient number, since it is larger than the sum of its proper divisors (663129492548).
27856745646601 is an frugal number, since it uses more digits than its factorization.
27856745646601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 245572 (or 122786 counting only the distinct ones).
The product of its (nonzero) digits is 406425600, while the sum is 67.
The spelling of 27856745646601 in words is "twenty-seven trillion, eight hundred fifty-six billion, seven hundred forty-five million, six hundred forty-six thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •