Base | Representation |
---|---|
bin | 1000101000011010001… |
… | …1100011101111000001 |
3 | 112011202022221101210201 |
4 | 2022012203203233001 |
5 | 4412142301401132 |
6 | 152042151125201 |
7 | 13466450142553 |
oct | 2120643435701 |
9 | 464668841721 |
10 | 148286356417 |
11 | 57984867391 |
12 | 248a4973801 |
13 | 10ca2536a84 |
14 | 7269d574d3 |
15 | 3ccd4332e7 |
hex | 22868e3bc1 |
148286356417 has 4 divisors (see below), whose sum is σ = 148833538816. Its totient is φ = 147739174020.
The previous prime is 148286356409. The next prime is 148286356489. The reversal of 148286356417 is 714653682841.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 714653682841 = 7 ⋅102093383263.
It is a cyclic number.
It is not a de Polignac number, because 148286356417 - 23 = 148286356409 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (148286356717) by changing a digit.
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, 273590793 + ... + 273591334.
It is an arithmetic number, because the mean of its divisors is an integer number (37208384704).
Almost surely, 2148286356417 is an apocalyptic number.
It is an amenable number.
148286356417 is a deficient number, since it is larger than the sum of its proper divisors (547182399).
148286356417 is an equidigital number, since it uses as much as digits as its factorization.
148286356417 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 547182398.
The product of its digits is 7741440, while the sum is 55.
The spelling of 148286356417 in words is "one hundred forty-eight billion, two hundred eighty-six million, three hundred fifty-six thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •