Base | Representation |
---|---|
bin | 1000101001101001111… |
… | …0011111011011100111 |
3 | 112012121121211022221010 |
4 | 2022122132133123213 |
5 | 4413333331304031 |
6 | 152135250353303 |
7 | 13510646010264 |
oct | 2123236373347 |
9 | 465547738833 |
10 | 148620572391 |
11 | 58036490835 |
12 | 2497888b833 |
13 | 110268547c5 |
14 | 729c4b626b |
15 | 3cec950246 |
hex | 229a79f6e7 |
148620572391 has 32 divisors (see below), whose sum is σ = 217700352000. Its totient is φ = 89767627488.
The previous prime is 148620572381. The next prime is 148620572411. The reversal of 148620572391 is 193275026841.
It is not a de Polignac number, because 148620572391 - 227 = 148486354663 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 148620572391.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (148620572381) 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 31 ways as a sum of consecutive naturals, for example, 13312870 + ... + 13324028.
It is an arithmetic number, because the mean of its divisors is an integer number (6803136000).
It is a 1-persistent number, because it is pandigital, but 2⋅148620572391 = 297241144782 is not.
Almost surely, 2148620572391 is an apocalyptic number.
148620572391 is a deficient number, since it is larger than the sum of its proper divisors (69079779609).
148620572391 is a wasteful number, since it uses less digits than its factorization.
148620572391 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21363.
The product of its (nonzero) digits is 725760, while the sum is 48.
The spelling of 148620572391 in words is "one hundred forty-eight billion, six hundred twenty million, five hundred seventy-two thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •