Base | Representation |
---|---|
bin | 100010000010001010001000… |
… | …011111101101011010110001 |
3 | 201121222110010222201200210221 |
4 | 202002022020133231122301 |
5 | 124104342012432420343 |
6 | 1250202525443053041 |
7 | 43346106011556352 |
oct | 4202121037553261 |
9 | 647873128650727 |
10 | 149681900279473 |
11 | 43769812566051 |
12 | 14955431671181 |
13 | 6569c33c63503 |
14 | 28d68dd52dd29 |
15 | 1248882c6a5ed |
hex | 8822887ed6b1 |
149681900279473 has 2 divisors, whose sum is σ = 149681900279474. Its totient is φ = 149681900279472.
The previous prime is 149681900279453. The next prime is 149681900279543. The reversal of 149681900279473 is 374972009186941.
It is an a-pointer prime, because the next prime (149681900279543) can be obtained adding 149681900279473 to its sum of digits (70).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 125733678888609 + 23948221390864 = 11213103^2 + 4893692^2 .
It is a cyclic number.
It is not a de Polignac number, because 149681900279473 - 29 = 149681900278961 is a prime.
It is not a weakly prime, because it can be changed into another prime (149681900279453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 74840950139736 + 74840950139737.
It is an arithmetic number, because the mean of its divisors is an integer number (74840950139737).
Almost surely, 2149681900279473 is an apocalyptic number.
It is an amenable number.
149681900279473 is a deficient number, since it is larger than the sum of its proper divisors (1).
149681900279473 is an equidigital number, since it uses as much as digits as its factorization.
149681900279473 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 164602368, while the sum is 70.
The spelling of 149681900279473 in words is "one hundred forty-nine trillion, six hundred eighty-one billion, nine hundred million, two hundred seventy-nine thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •