Base | Representation |
---|---|
bin | 1001000001100101111… |
… | …1111111101110100110 |
3 | 112211012110121102020112 |
4 | 2100121133333232212 |
5 | 10020013414444200 |
6 | 155121043333022 |
7 | 14126125462004 |
oct | 2203137775646 |
9 | 484173542215 |
10 | 155046640550 |
11 | 5a83387196a |
12 | 26070981172 |
13 | 1180bc8b2b9 |
14 | 770bb13a74 |
15 | 4076b9a535 |
hex | 24197ffba6 |
155046640550 has 12 divisors (see below), whose sum is σ = 288386751516. Its totient is φ = 62018656200.
The previous prime is 155046640543. The next prime is 155046640577. The reversal of 155046640550 is 55046640551.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 155046640498 and 155046640507.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1550466356 + ... + 1550466455.
It is an arithmetic number, because the mean of its divisors is an integer number (24032229293).
Almost surely, 2155046640550 is an apocalyptic number.
155046640550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
155046640550 is a deficient number, since it is larger than the sum of its proper divisors (133340110966).
155046640550 is a wasteful number, since it uses less digits than its factorization.
155046640550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3100932823 (or 3100932818 counting only the distinct ones).
The product of its (nonzero) digits is 360000, while the sum is 41.
Subtracting from 155046640550 its reverse (55046640551), we obtain a palindrome (99999999999).
The spelling of 155046640550 in words is "one hundred fifty-five billion, forty-six million, six hundred forty thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •