Base | Representation |
---|---|
bin | 10010011111010… |
… | …11101011011100 |
3 | 101210212012110010 |
4 | 21033223223130 |
5 | 304201343022 |
6 | 23220243220 |
7 | 3562244055 |
oct | 1117535334 |
9 | 353765403 |
10 | 155106012 |
11 | 7a60a496 |
12 | 43b40510 |
13 | 26199009 |
14 | 1685772c |
15 | d93c50c |
hex | 93ebadc |
155106012 has 12 divisors (see below), whose sum is σ = 361914056. Its totient is φ = 51702000.
The previous prime is 155105999. The next prime is 155106013. The reversal of 155106012 is 210601551.
It is a tau number, because it is divible by the number of its divisors (12).
It is a self number, because there is not a number n which added to its sum of digits gives 155106012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155106013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6462739 + ... + 6462762.
Almost surely, 2155106012 is an apocalyptic number.
155106012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
155106012 is an abundant number, since it is smaller than the sum of its proper divisors (206808044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155106012 is a wasteful number, since it uses less digits than its factorization.
155106012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12925508 (or 12925506 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 21.
The square root of 155106012 is about 12454.1564146272. The cubic root of 155106012 is about 537.2909727696.
Adding to 155106012 its reverse (210601551), we get a palindrome (365707563).
The spelling of 155106012 in words is "one hundred fifty-five million, one hundred six thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •