Base | Representation |
---|---|
bin | 100011010010111110111010… |
… | …101100111100100111000101 |
3 | 202100122102121011212021011020 |
4 | 203102332322230330213011 |
5 | 130321342101120332401 |
6 | 1310054255052101353 |
7 | 44461304101513626 |
oct | 4322767254744705 |
9 | 670572534767136 |
10 | 155236135324101 |
11 | 45510303435837 |
12 | 154b1977764859 |
13 | 6880921441110 |
14 | 2a4967d085a4d |
15 | 12e30ac667d36 |
hex | 8d2fbab3c9c5 |
155236135324101 has 32 divisors (see below), whose sum is σ = 223062078062208. Its totient is φ = 95461844785920.
The previous prime is 155236135324099. The next prime is 155236135324111. The reversal of 155236135324101 is 101423531632551.
It is not a de Polignac number, because 155236135324101 - 21 = 155236135324099 is a prime.
It is a super-2 number, since 2×1552361353241012 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155236135324111) 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, 391182555 + ... + 391579191.
It is an arithmetic number, because the mean of its divisors is an integer number (6970689939444).
Almost surely, 2155236135324101 is an apocalyptic number.
It is an amenable number.
155236135324101 is a deficient number, since it is larger than the sum of its proper divisors (67825942738107).
155236135324101 is a wasteful number, since it uses less digits than its factorization.
155236135324101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 403781.
The product of its (nonzero) digits is 324000, while the sum is 42.
Adding to 155236135324101 its reverse (101423531632551), we get a palindrome (256659666956652).
The spelling of 155236135324101 in words is "one hundred fifty-five trillion, two hundred thirty-six billion, one hundred thirty-five million, three hundred twenty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •