Base | Representation |
---|---|
bin | 1001000010001101110… |
… | …0000111010111000000 |
3 | 112211122002101102212210 |
4 | 2100203130013113000 |
5 | 10020334112123032 |
6 | 155145401422120 |
7 | 14133222043506 |
oct | 2204334072700 |
9 | 484562342783 |
10 | 155213395392 |
11 | 5a909a08290 |
12 | 260b879a940 |
13 | 118376a54c3 |
14 | 7725d20676 |
15 | 40866392cc |
hex | 24237075c0 |
155213395392 has 112 divisors (see below), whose sum is σ = 463450838400. Its totient is φ = 45412469760.
The previous prime is 155213395367. The next prime is 155213395417. The reversal of 155213395392 is 293593312551.
It is an interprime number because it is at equal distance from previous prime (155213395367) and next prime (155213395417).
It is a super-2 number, since 2×1552133953922 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1205842 + ... + 1328337.
Almost surely, 2155213395392 is an apocalyptic number.
155213395392 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
155213395392 is an abundant number, since it is smaller than the sum of its proper divisors (308237443008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155213395392 is a wasteful number, since it uses less digits than its factorization.
155213395392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2534234 (or 2534224 counting only the distinct ones).
The product of its digits is 1093500, while the sum is 48.
The spelling of 155213395392 in words is "one hundred fifty-five billion, two hundred thirteen million, three hundred ninety-five thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •