Base | Representation |
---|---|
bin | 1000101001111011110… |
… | …1101000001000101011 |
3 | 112012210212110111022012 |
4 | 2022132331220020223 |
5 | 4414012113441441 |
6 | 152150535550135 |
7 | 13512551546225 |
oct | 2123675501053 |
9 | 465725414265 |
10 | 148695843371 |
11 | 58074a21a59 |
12 | 24999b2b34b |
13 | 1103931a54a |
14 | 72a84ab415 |
15 | 3d0436c9eb |
hex | 229ef6822b |
148695843371 has 2 divisors, whose sum is σ = 148695843372. Its totient is φ = 148695843370.
The previous prime is 148695843313. The next prime is 148695843427. The reversal of 148695843371 is 173348596841.
148695843371 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-148695843371 is a prime.
It is a super-2 number, since 2×1486958433712 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 148695843371.
It is not a weakly prime, because it can be changed into another prime (148695843301) 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 as a sum of consecutive naturals, namely, 74347921685 + 74347921686.
It is an arithmetic number, because the mean of its divisors is an integer number (74347921686).
Almost surely, 2148695843371 is an apocalyptic number.
148695843371 is a deficient number, since it is larger than the sum of its proper divisors (1).
148695843371 is an equidigital number, since it uses as much as digits as its factorization.
148695843371 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 17418240, while the sum is 59.
The spelling of 148695843371 in words is "one hundred forty-eight billion, six hundred ninety-five million, eight hundred forty-three thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •