Base | Representation |
---|---|
bin | 1000101001011101101… |
… | …1110101011101011101 |
3 | 112012111001210211212202 |
4 | 2022113123311131131 |
5 | 4413232300411131 |
6 | 152130224541245 |
7 | 13506456202115 |
oct | 2122733653535 |
9 | 465431724782 |
10 | 148569544541 |
11 | 5800a6a8860 |
12 | 24963781825 |
13 | 110190c9602 |
14 | 72957d2045 |
15 | 3ce8220bcb |
hex | 22976f575d |
148569544541 has 48 divisors (see below), whose sum is σ = 176901848640. Its totient is φ = 123649720320.
The previous prime is 148569544517. The next prime is 148569544561. The reversal of 148569544541 is 145445965841.
It is not a de Polignac number, because 148569544541 - 26 = 148569544477 is a prime.
It is a Smith number, since the sum of its digits (56) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (148569544561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 35129015 + ... + 35133243.
It is an arithmetic number, because the mean of its divisors is an integer number (3685455180).
Almost surely, 2148569544541 is an apocalyptic number.
148569544541 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
148569544541 is a deficient number, since it is larger than the sum of its proper divisors (28332304099).
148569544541 is a wasteful number, since it uses less digits than its factorization.
148569544541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4574 (or 4557 counting only the distinct ones).
The product of its digits is 13824000, while the sum is 56.
The spelling of 148569544541 in words is "one hundred forty-eight billion, five hundred sixty-nine million, five hundred forty-four thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •