Base | Representation |
---|---|
bin | 1000011100101100001… |
… | …1010000101101100110 |
3 | 111212122002112220100112 |
4 | 2013023003100231212 |
5 | 4334221440104002 |
6 | 150402053413022 |
7 | 13325501216003 |
oct | 2071303205546 |
9 | 455562486315 |
10 | 145140550502 |
11 | 56610069892 |
12 | 2416733a172 |
13 | 108c089165c |
14 | 704c2388aa |
15 | 3b9718c852 |
hex | 21cb0d0b66 |
145140550502 has 8 divisors (see below), whose sum is σ = 224733755712. Its totient is φ = 70229298600.
The previous prime is 145140550483. The next prime is 145140550553. The reversal of 145140550502 is 205055041541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1451405505022 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1170488249 + ... + 1170488372.
It is an arithmetic number, because the mean of its divisors is an integer number (28091719464).
Almost surely, 2145140550502 is an apocalyptic number.
145140550502 is a deficient number, since it is larger than the sum of its proper divisors (79593205210).
145140550502 is a wasteful number, since it uses less digits than its factorization.
145140550502 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2340976654.
The product of its (nonzero) digits is 20000, while the sum is 32.
The spelling of 145140550502 in words is "one hundred forty-five billion, one hundred forty million, five hundred fifty thousand, five hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •