Base | Representation |
---|---|
bin | 1100011101100011110001… |
… | …01100011010100010011000 |
3 | 10121000210022001010100021101 |
4 | 12032301320230122202120 |
5 | 12042441210030214212 |
6 | 134141104010521144 |
7 | 5525603406565231 |
oct | 616617054324230 |
9 | 117023261110241 |
10 | 27403916257432 |
11 | 8805a32343970 |
12 | 30a70901361b4 |
13 | 123a2416cb390 |
14 | 6aa4dc80c088 |
15 | 327c8abb1157 |
hex | 18ec78b1a898 |
27403916257432 has 128 divisors (see below), whose sum is σ = 62002248517440. Its totient is φ = 11186396282880.
The previous prime is 27403916257391. The next prime is 27403916257433. The reversal of 27403916257432 is 23475261930472.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27403916257433) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 655936128 + ... + 655977904.
Almost surely, 227403916257432 is an apocalyptic number.
27403916257432 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 27403916257432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31001124258720).
27403916257432 is an abundant number, since it is smaller than the sum of its proper divisors (34598332260008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27403916257432 is a wasteful number, since it uses less digits than its factorization.
27403916257432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57341 (or 57337 counting only the distinct ones).
The product of its (nonzero) digits is 15240960, while the sum is 55.
The spelling of 27403916257432 in words is "twenty-seven trillion, four hundred three billion, nine hundred sixteen million, two hundred fifty-seven thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •