Base | Representation |
---|---|
bin | 1001000010111100000… |
… | …1101010011101011000 |
3 | 112212010122011121012222 |
4 | 2100233001222131120 |
5 | 10021233343202424 |
6 | 155220544123212 |
7 | 14141102254430 |
oct | 2205701523530 |
9 | 485118147188 |
10 | 155407787864 |
11 | 5a9a971021a |
12 | 26151906508 |
13 | 11868a48334 |
14 | 7743a832c0 |
15 | 4098736e5e |
hex | 242f06a758 |
155407787864 has 32 divisors (see below), whose sum is σ = 350543884800. Its totient is φ = 63097898400.
The previous prime is 155407787861. The next prime is 155407787917. The reversal of 155407787864 is 468787704551.
It is a junction number, because it is equal to n+sod(n) for n = 155407787797 and 155407787806.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155407787861) 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 7 ways as a sum of consecutive naturals, for example, 73028912 + ... + 73031039.
It is an arithmetic number, because the mean of its divisors is an integer number (10954496400).
Almost surely, 2155407787864 is an apocalyptic number.
155407787864 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
155407787864 is an abundant number, since it is smaller than the sum of its proper divisors (195136096936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155407787864 is a wasteful number, since it uses less digits than its factorization.
155407787864 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146059983 (or 146059979 counting only the distinct ones).
The product of its (nonzero) digits is 52684800, while the sum is 62.
The spelling of 155407787864 in words is "one hundred fifty-five billion, four hundred seven million, seven hundred eighty-seven thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •