Base | Representation |
---|---|
bin | 10010100001001… |
… | …01101000110100 |
3 | 101211022021002201 |
4 | 21100211220310 |
5 | 304231442122 |
6 | 23225314244 |
7 | 3564253150 |
oct | 1120455064 |
9 | 354267081 |
10 | 155343412 |
11 | 7a761894 |
12 | 44035984 |
13 | 262500a3 |
14 | 168ba060 |
15 | d987a27 |
hex | 9425a34 |
155343412 has 24 divisors (see below), whose sum is σ = 311451840. Its totient is φ = 66411840.
The previous prime is 155343407. The next prime is 155343439. The reversal of 155343412 is 214343551.
155343412 is digitally balanced in base 3 and base 9, because in such bases it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (28).
155343412 is strictly pandigital in base 9.
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 7 ways as a sum of consecutive naturals, for example, 5112 + ... + 18352.
It is an arithmetic number, because the mean of its divisors is an integer number (12977160).
Almost surely, 2155343412 is an apocalyptic number.
It is an amenable number.
155343412 is an abundant number, since it is smaller than the sum of its proper divisors (156108428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155343412 is a wasteful number, since it uses less digits than its factorization.
155343412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13671 (or 13669 counting only the distinct ones).
The product of its digits is 7200, while the sum is 28.
The square root of 155343412 is about 12463.6837251272. The cubic root of 155343412 is about 537.5649528140.
Adding to 155343412 its reverse (214343551), we get a palindrome (369686963).
The spelling of 155343412 in words is "one hundred fifty-five million, three hundred forty-three thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.200 sec. • engine limits •