Base | Representation |
---|---|
bin | 100011010001001110001101… |
… | …010010000011001100111001 |
3 | 202100012212020000021220012121 |
4 | 203101032031102003030321 |
5 | 130312401223214323301 |
6 | 1305522522201441241 |
7 | 44446461063166501 |
oct | 4321161522031471 |
9 | 670185200256177 |
10 | 155115114214201 |
11 | 45473a50149739 |
12 | 15492421aa0221 |
13 | 68723a583820b |
14 | 2a4387c298a01 |
15 | 12ded77c113a1 |
hex | 8d138d483339 |
155115114214201 has 16 divisors (see below), whose sum is σ = 160590744740160. Its totient is φ = 149647976210880.
The previous prime is 155115114214189. The next prime is 155115114214211. The reversal of 155115114214201 is 102412411511551.
It is a cyclic number.
It is not a de Polignac number, because 155115114214201 - 213 = 155115114206009 is a prime.
It is a super-2 number, since 2×1551151142142012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (155115114214211) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 237037066 + ... + 237690556.
It is an arithmetic number, because the mean of its divisors is an integer number (10036921546260).
Almost surely, 2155115114214201 is an apocalyptic number.
It is an amenable number.
155115114214201 is a deficient number, since it is larger than the sum of its proper divisors (5475630525959).
155115114214201 is a wasteful number, since it uses less digits than its factorization.
155115114214201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 659976.
The product of its (nonzero) digits is 8000, while the sum is 34.
Adding to 155115114214201 its reverse (102412411511551), we get a palindrome (257527525725752).
The spelling of 155115114214201 in words is "one hundred fifty-five trillion, one hundred fifteen billion, one hundred fourteen million, two hundred fourteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •