Base | Representation |
---|---|
bin | 10010100001001… |
… | …01010011000110 |
3 | 101211022012012020 |
4 | 21100211103012 |
5 | 304231421042 |
6 | 23225304010 |
7 | 3564246123 |
oct | 1120452306 |
9 | 354265166 |
10 | 155342022 |
11 | 7a760840 |
12 | 44035006 |
13 | 2624c574 |
14 | 168b974a |
15 | d9873ec |
hex | 94254c6 |
155342022 has 32 divisors (see below), whose sum is σ = 358867584. Its totient is φ = 44304000.
The previous prime is 155342017. The next prime is 155342041. The reversal of 155342022 is 220243551.
155342022 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1553420222 = 48262287598096968, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 155341983 and 155342001.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 68104 + ... + 70347.
It is an arithmetic number, because the mean of its divisors is an integer number (11214612).
Almost surely, 2155342022 is an apocalyptic number.
155342022 is an abundant number, since it is smaller than the sum of its proper divisors (203525562).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155342022 is a wasteful number, since it uses less digits than its factorization.
155342022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138484.
The product of its (nonzero) digits is 2400, while the sum is 24.
The square root of 155342022 is about 12463.6279629970. The cubic root of 155342022 is about 537.5633494470.
Adding to 155342022 its reverse (220243551), we get a palindrome (375585573).
The spelling of 155342022 in words is "one hundred fifty-five million, three hundred forty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •