Base | Representation |
---|---|
bin | 1000101001001001001… |
… | …1001111100100111101 |
3 | 112012021001201120012122 |
4 | 2022102103033210331 |
5 | 4413043222444031 |
6 | 152113510412325 |
7 | 13504362061550 |
oct | 2122223174475 |
9 | 465231646178 |
10 | 148483406141 |
11 | 57a760147a4 |
12 | 2493a9610a5 |
13 | 110042ca245 |
14 | 72881ac697 |
15 | 3ce08a847b |
hex | 22924cf93d |
148483406141 has 16 divisors (see below), whose sum is σ = 177089808384. Its totient is φ = 121726652784.
The previous prime is 148483406087. The next prime is 148483406177. The reversal of 148483406141 is 141604384841.
148483406141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 148483406141 - 226 = 148416297277 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 148483406092 and 148483406101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (148483405141) 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 15 ways as a sum of consecutive naturals, for example, 1999706 + ... + 2072628.
It is an arithmetic number, because the mean of its divisors is an integer number (11068113024).
Almost surely, 2148483406141 is an apocalyptic number.
It is an amenable number.
148483406141 is a deficient number, since it is larger than the sum of its proper divisors (28606402243).
148483406141 is a wasteful number, since it uses less digits than its factorization.
148483406141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85600.
The product of its (nonzero) digits is 294912, while the sum is 44.
The spelling of 148483406141 in words is "one hundred forty-eight billion, four hundred eighty-three million, four hundred six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •