Base | Representation |
---|---|
bin | 1000101001000111010… |
… | …1010111101000111001 |
3 | 112012020111222200200111 |
4 | 2022101311113220321 |
5 | 4413034221343331 |
6 | 152113030504321 |
7 | 13504235364016 |
oct | 2122165275071 |
9 | 465214880614 |
10 | 148475574841 |
11 | 57a71655a50 |
12 | 249382050a1 |
13 | 110027b7839 |
14 | 728713070d |
15 | 3cded5cdb1 |
hex | 2291d57a39 |
148475574841 has 24 divisors (see below), whose sum is σ = 171935875584. Its totient is φ = 127133958240.
The previous prime is 148475574829. The next prime is 148475574857.
148475574841 is nontrivially palindromic in base 10.
148475574841 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 148475574841 - 29 = 148475574329 is a prime.
It is not an unprimeable number, because it can be changed into a prime (148475574041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 578920 + ... + 795046.
It is an arithmetic number, because the mean of its divisors is an integer number (7163994816).
Almost surely, 2148475574841 is an apocalyptic number.
148475574841 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
148475574841 is a deficient number, since it is larger than the sum of its proper divisors (23460300743).
148475574841 is a wasteful number, since it uses less digits than its factorization.
148475574841 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216349 (or 216330 counting only the distinct ones).
The product of its digits is 20070400, while the sum is 58.
The spelling of 148475574841 in words is "one hundred forty-eight billion, four hundred seventy-five million, five hundred seventy-four thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •