Base | Representation |
---|---|
bin | 1100011101110110110000… |
… | …10010110111000110111010 |
3 | 10121001202121110122111200220 |
4 | 12032323120102313012322 |
5 | 12043123044141343132 |
6 | 134145511320240510 |
7 | 5526414130064412 |
oct | 616733022670672 |
9 | 117052543574626 |
10 | 27414110106042 |
11 | 880a29351a240 |
12 | 30a9056010136 |
13 | 123b1a75cac6a |
14 | 6aabc85d1642 |
15 | 328185ab0a2c |
hex | 18eed84b71ba |
27414110106042 has 32 divisors (see below), whose sum is σ = 62960635653120. Its totient is φ = 7870079455920.
The previous prime is 27414110106017. The next prime is 27414110106067. The reversal of 27414110106042 is 24060101141472.
It is an interprime number because it is at equal distance from previous prime (27414110106017) and next prime (27414110106067).
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 27414110105994 and 27414110106012.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10930664658 + ... + 10930667165.
It is an arithmetic number, because the mean of its divisors is an integer number (1967519864160).
Almost surely, 227414110106042 is an apocalyptic number.
27414110106042 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
27414110106042 is an abundant number, since it is smaller than the sum of its proper divisors (35546525547078).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27414110106042 is a wasteful number, since it uses less digits than its factorization.
27414110106042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21861331858.
The product of its (nonzero) digits is 10752, while the sum is 33.
The spelling of 27414110106042 in words is "twenty-seven trillion, four hundred fourteen billion, one hundred ten million, one hundred six thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •