Base | Representation |
---|---|
bin | 111101011001101111110001… |
… | …1000101111011100111001110 |
3 | 2121211100002010112022022202112 |
4 | 1322303133203011323213032 |
5 | 1031243000244030002342 |
6 | 5152410343121024022 |
7 | 221522645333531306 |
oct | 17263374305734716 |
9 | 2554302115268675 |
10 | 540100242422222 |
11 | 147102254510389 |
12 | 506ab066485012 |
13 | 1a24a307a59391 |
14 | 9752dc3c5c606 |
15 | 42693a7c8d682 |
hex | 1eb37e317b9ce |
540100242422222 has 8 divisors (see below), whose sum is σ = 852789856456200. Its totient is φ = 255836956936824.
The previous prime is 540100242422201. The next prime is 540100242422243. The reversal of 540100242422222 is 222224242001045.
It is an interprime number because it is at equal distance from previous prime (540100242422201) and next prime (540100242422243).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7106582137097 + ... + 7106582137172.
It is an arithmetic number, because the mean of its divisors is an integer number (106598732057025).
Almost surely, 2540100242422222 is an apocalyptic number.
540100242422222 is a deficient number, since it is larger than the sum of its proper divisors (312689614033978).
540100242422222 is a wasteful number, since it uses less digits than its factorization.
540100242422222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14213164274290.
The product of its (nonzero) digits is 40960, while the sum is 32.
Adding to 540100242422222 its reverse (222224242001045), we get a palindrome (762324484423267).
The spelling of 540100242422222 in words is "five hundred forty trillion, one hundred billion, two hundred forty-two million, four hundred twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •