Base | Representation |
---|---|
bin | 1001000010101000001… |
… | …1101100001011001001 |
3 | 112211220211022201222101 |
4 | 2100222003230023021 |
5 | 10021101023324342 |
6 | 155204405353401 |
7 | 14136040616551 |
oct | 2205203541311 |
9 | 484824281871 |
10 | 155324433097 |
11 | 5a966658589 |
12 | 26129a08861 |
13 | 118546b1ca2 |
14 | 7736986161 |
15 | 409126e3b7 |
hex | 242a0ec2c9 |
155324433097 has 4 divisors (see below), whose sum is σ = 163499403280. Its totient is φ = 147149462916.
The previous prime is 155324432969. The next prime is 155324433109. The reversal of 155324433097 is 790334423551.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 790334423551 = 47 ⋅16815626033.
It is a cyclic number.
It is not a de Polignac number, because 155324433097 - 27 = 155324432969 is a prime.
It is a super-2 number, since 2×1553244330972 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (155324436097) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4087485063 + ... + 4087485100.
It is an arithmetic number, because the mean of its divisors is an integer number (40874850820).
Almost surely, 2155324433097 is an apocalyptic number.
It is an amenable number.
155324433097 is a deficient number, since it is larger than the sum of its proper divisors (8174970183).
155324433097 is an equidigital number, since it uses as much as digits as its factorization.
155324433097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8174970182.
The product of its (nonzero) digits is 1360800, while the sum is 46.
The spelling of 155324433097 in words is "one hundred fifty-five billion, three hundred twenty-four million, four hundred thirty-three thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •