Base | Representation |
---|---|
bin | 100001101010111010001100… |
… | …110110100111000011011111 |
3 | 201102022201022200111200102202 |
4 | 201222322030312213003133 |
5 | 123402203013330314341 |
6 | 1242540544021442115 |
7 | 43122506436523436 |
oct | 4152721466470337 |
9 | 642281280450382 |
10 | 148084245557471 |
11 | 432031a3083743 |
12 | 1473787627033b |
13 | 6482390ba6642 |
14 | 287d45c4da11d |
15 | 121c0274ed79b |
hex | 86ae8cda70df |
148084245557471 has 16 divisors (see below), whose sum is σ = 151986296706048. Its totient is φ = 144232812712800.
The previous prime is 148084245557447. The next prime is 148084245557497. The reversal of 148084245557471 is 174755542480841.
It is a cyclic number.
It is not a de Polignac number, because 148084245557471 - 214 = 148084245541087 is a prime.
It is a super-3 number, since 3×1480842455574713 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 148084245557398 and 148084245557407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (148084245557431) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 128311325 + ... + 129460281.
It is an arithmetic number, because the mean of its divisors is an integer number (9499143544128).
Almost surely, 2148084245557471 is an apocalyptic number.
148084245557471 is a deficient number, since it is larger than the sum of its proper divisors (3902051148577).
148084245557471 is a wasteful number, since it uses less digits than its factorization.
148084245557471 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1170982.
The product of its (nonzero) digits is 200704000, while the sum is 65.
The spelling of 148084245557471 in words is "one hundred forty-eight trillion, eighty-four billion, two hundred forty-five million, five hundred fifty-seven thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •