Base | Representation |
---|---|
bin | 100011001111110001000110… |
… | …000100000010010011001111 |
3 | 202022212022011021222012002101 |
4 | 203033301012010002103033 |
5 | 130304231444042012401 |
6 | 1305404545302335531 |
7 | 44436321361631635 |
oct | 4317610604022317 |
9 | 668768137865071 |
10 | 155015135110351 |
11 | 4543560559618a |
12 | 15476b7b12a5a7 |
13 | 6865b31463a79 |
14 | 2a3cab5d17355 |
15 | 12dc475753101 |
hex | 8cfc461024cf |
155015135110351 has 16 divisors (see below), whose sum is σ = 159059154840768. Its totient is φ = 150983659756800.
The previous prime is 155015135110337. The next prime is 155015135110411. The reversal of 155015135110351 is 153011531510551.
It is a cyclic number.
It is not a de Polignac number, because 155015135110351 - 29 = 155015135109839 is a prime.
It is a super-2 number, since 2×1550151351103512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 155015135110351.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155015135110301) 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, 1650613086 + ... + 1650706996.
It is an arithmetic number, because the mean of its divisors is an integer number (9941197177548).
Almost surely, 2155015135110351 is an apocalyptic number.
155015135110351 is a deficient number, since it is larger than the sum of its proper divisors (4044019730417).
155015135110351 is an equidigital number, since it uses as much as digits as its factorization.
155015135110351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160242.
The product of its (nonzero) digits is 28125, while the sum is 37.
The spelling of 155015135110351 in words is "one hundred fifty-five trillion, fifteen billion, one hundred thirty-five million, one hundred ten thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •