Base | Representation |
---|---|
bin | 100001000100001011001100… |
… | …011010010011100111111001 |
3 | 201001220020201022222122021110 |
4 | 201010023030122103213321 |
5 | 123030100120112444103 |
6 | 1233142050522430533 |
7 | 42426265302111345 |
oct | 4104131432234771 |
9 | 631806638878243 |
10 | 145422432156153 |
11 | 42377341885029 |
12 | 14387a12362449 |
13 | 631b379654a79 |
14 | 27ca6aa14c625 |
15 | 11c2b87b4b403 |
hex | 8442cc6939f9 |
145422432156153 has 8 divisors (see below), whose sum is σ = 193896792735808. Its totient is φ = 96948179840304.
The previous prime is 145422432156151. The next prime is 145422432156167. The reversal of 145422432156153 is 351651234224541.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 145422432156153 - 21 = 145422432156151 is a prime.
It is a super-2 number, since 2×1454224321561532 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145422432156151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23878126 + ... + 29342967.
It is an arithmetic number, because the mean of its divisors is an integer number (24237099091976).
Almost surely, 2145422432156153 is an apocalyptic number.
It is an amenable number.
145422432156153 is a deficient number, since it is larger than the sum of its proper divisors (48474360579655).
145422432156153 is an equidigital number, since it uses as much as digits as its factorization.
145422432156153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54131903.
The product of its digits is 3456000, while the sum is 48.
The spelling of 145422432156153 in words is "one hundred forty-five trillion, four hundred twenty-two billion, four hundred thirty-two million, one hundred fifty-six thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •