Base | Representation |
---|---|
bin | 1001000001011100011… |
… | …0100001111111011001 |
3 | 112211002122220112021120 |
4 | 2100113012201333121 |
5 | 10014423120120323 |
6 | 155113045155453 |
7 | 14125126515600 |
oct | 2202706417731 |
9 | 484078815246 |
10 | 155006410713 |
11 | 5a813094670 |
12 | 2605b3bbb89 |
13 | 11803843c6b |
14 | 7706640a37 |
15 | 40733a05e3 |
hex | 24171a1fd9 |
155006410713 has 96 divisors (see below), whose sum is σ = 265737830400. Its totient is φ = 79466365440.
The previous prime is 155006410681. The next prime is 155006410751. The reversal of 155006410713 is 317014600551.
155006410713 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 155006410713 - 25 = 155006410681 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (155006410313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 40864545 + ... + 40868337.
It is an arithmetic number, because the mean of its divisors is an integer number (2768102400).
Almost surely, 2155006410713 is an apocalyptic number.
It is an amenable number.
155006410713 is a deficient number, since it is larger than the sum of its proper divisors (110731419687).
155006410713 is a wasteful number, since it uses less digits than its factorization.
155006410713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4147 (or 4140 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 33.
The spelling of 155006410713 in words is "one hundred fifty-five billion, six million, four hundred ten thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •