Base | Representation |
---|---|
bin | 100011010000001010101100… |
… | …101001011110000111100111 |
3 | 202022221221010011221020211120 |
4 | 203100022230221132013213 |
5 | 130310204244224102211 |
6 | 1305425333223505023 |
7 | 44441313543442155 |
oct | 4320125451360747 |
9 | 668857104836746 |
10 | 155042626003431 |
11 | 45446232476031 |
12 | 154803718b8173 |
13 | 68685c2a5b4ca |
14 | 2a401630203d5 |
15 | 12dd033e52d06 |
hex | 8d02aca5e1e7 |
155042626003431 has 8 divisors (see below), whose sum is σ = 206723919926784. Its totient is φ = 103361541374520.
The previous prime is 155042626003429. The next prime is 155042626003511. The reversal of 155042626003431 is 134300626240551.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 155042626003431 - 21 = 155042626003429 is a prime.
It is a super-2 number, since 2×1550426260034312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155042626003231) 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 7 ways as a sum of consecutive naturals, for example, 50586871 + ... + 53564136.
It is an arithmetic number, because the mean of its divisors is an integer number (25840489990848).
Almost surely, 2155042626003431 is an apocalyptic number.
155042626003431 is a deficient number, since it is larger than the sum of its proper divisors (51681293923353).
155042626003431 is a wasteful number, since it uses less digits than its factorization.
155042626003431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104647221.
The product of its (nonzero) digits is 518400, while the sum is 42.
The spelling of 155042626003431 in words is "one hundred fifty-five trillion, forty-two billion, six hundred twenty-six million, three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •