Base | Representation |
---|---|
bin | 100010010110001110100101… |
… | …001101011000010001100000 |
3 | 201210212022000110022121221211 |
4 | 202112032211031120101200 |
5 | 124244441031011444202 |
6 | 1253140255041555504 |
7 | 43550542023263044 |
oct | 4226164515302140 |
9 | 653768013277854 |
10 | 151061066515552 |
11 | 44150702992126 |
12 | 14b38791645b94 |
13 | 6639cc751a60b |
14 | 2943574c1a024 |
15 | 126e6a1d681d7 |
hex | 8963a5358460 |
151061066515552 has 12 divisors (see below), whose sum is σ = 297401474702556. Its totient is φ = 75530533257760.
The previous prime is 151061066515529. The next prime is 151061066515561. The reversal of 151061066515552 is 255515660160151.
It is a junction number, because it is equal to n+sod(n) for n = 151061066515496 and 151061066515505.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2360329164274 + ... + 2360329164337.
It is an arithmetic number, because the mean of its divisors is an integer number (24783456225213).
Almost surely, 2151061066515552 is an apocalyptic number.
It is an amenable number.
151061066515552 is a deficient number, since it is larger than the sum of its proper divisors (146340408187004).
151061066515552 is an equidigital number, since it uses as much as digits as its factorization.
151061066515552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4720658328621 (or 4720658328613 counting only the distinct ones).
The product of its (nonzero) digits is 1350000, while the sum is 49.
The spelling of 151061066515552 in words is "one hundred fifty-one trillion, sixty-one billion, sixty-six million, five hundred fifteen thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •