Base | Representation |
---|---|
bin | 100001101011001110000111… |
… | …100010011110100100010011 |
3 | 201102101202112002102102100200 |
4 | 201223032013202132210103 |
5 | 123403030313043331402 |
6 | 1242554442050550243 |
7 | 43124164415661546 |
oct | 4153160742364423 |
9 | 642352462372320 |
10 | 148105631230227 |
11 | 432112777a6160 |
12 | 1473ba44298383 |
13 | 64843bb684688 |
14 | 28804ca84485d |
15 | 121c879c2e21c |
hex | 86b38789e913 |
148105631230227 has 12 divisors (see below), whose sum is σ = 233378570423544. Its totient is φ = 89760988624320.
The previous prime is 148105631230153. The next prime is 148105631230231. The reversal of 148105631230227 is 722032136501841.
148105631230227 is a `hidden beast` number, since 1 + 4 + 8 + 1 + 0 + 5 + 6 + 312 + 302 + 27 = 666.
It is not a de Polignac number, because 148105631230227 - 27 = 148105631230099 is a prime.
It is not an unprimeable number, because it can be changed into a prime (148105631230727) 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 11 ways as a sum of consecutive naturals, for example, 748008238438 + ... + 748008238635.
It is an arithmetic number, because the mean of its divisors is an integer number (19448214201962).
Almost surely, 2148105631230227 is an apocalyptic number.
148105631230227 is a deficient number, since it is larger than the sum of its proper divisors (85272939193317).
148105631230227 is a wasteful number, since it uses less digits than its factorization.
148105631230227 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1496016477090 (or 1496016477087 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 45.
The spelling of 148105631230227 in words is "one hundred forty-eight trillion, one hundred five billion, six hundred thirty-one million, two hundred thirty thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •