Base | Representation |
---|---|
bin | 10011001010110111000100… |
… | …00110010110110110010011 |
3 | 12112020221101201101111110201 |
4 | 21211123202012112312103 |
5 | 21011130111201011321 |
6 | 225353320150240031 |
7 | 11610366225655615 |
oct | 1145334206266623 |
9 | 175227351344421 |
10 | 42154602360211 |
11 | 12482737078390 |
12 | 4889a17056017 |
13 | 1a6a214a43943 |
14 | a5a417a6cdb5 |
15 | 4d1810886291 |
hex | 2656e2196d93 |
42154602360211 has 32 divisors (see below), whose sum is σ = 47309178470400. Its totient is φ = 37223938903680.
The previous prime is 42154602360191. The next prime is 42154602360263. The reversal of 42154602360211 is 11206320645124.
42154602360211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 42154602360211 - 221 = 42154600263059 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is not an unprimeable number, because it can be changed into a prime (42154602360511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 855402670 + ... + 855451948.
It is an arithmetic number, because the mean of its divisors is an integer number (1478411827200).
Almost surely, 242154602360211 is an apocalyptic number.
42154602360211 is a deficient number, since it is larger than the sum of its proper divisors (5154576110189).
42154602360211 is a wasteful number, since it uses less digits than its factorization.
42154602360211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52819.
The product of its (nonzero) digits is 69120, while the sum is 37.
The spelling of 42154602360211 in words is "forty-two trillion, one hundred fifty-four billion, six hundred two million, three hundred sixty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.812 sec. • engine limits •