Base | Representation |
---|---|
bin | 11101100111011000111111… |
… | …111110011101001011100011 |
3 | 122002011210122222110111020111 |
4 | 131213120333332131023203 |
5 | 114033010003344234210 |
6 | 1141004050045152151 |
7 | 36302161440632365 |
oct | 3547307776351343 |
9 | 562153588414214 |
10 | 130250251555555 |
11 | 3855790442792a |
12 | 1273745585b657 |
13 | 578a7137ac801 |
14 | 2424208172d35 |
15 | 100d19450288a |
hex | 76763ff9d2e3 |
130250251555555 has 8 divisors (see below), whose sum is σ = 156324270668544. Its totient is φ = 104184222043200.
The previous prime is 130250251555537. The next prime is 130250251555583. The reversal of 130250251555555 is 555555152052031.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130250251555555 - 29 = 130250251555043 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130250251555499 and 130250251555508.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1997364291 + ... + 1997429500.
It is an arithmetic number, because the mean of its divisors is an integer number (19540533833568).
Almost surely, 2130250251555555 is an apocalyptic number.
130250251555555 is a deficient number, since it is larger than the sum of its proper divisors (26074019112989).
130250251555555 is an equidigital number, since it uses as much as digits as its factorization.
130250251555555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3994800317.
The product of its (nonzero) digits is 4687500, while the sum is 49.
The spelling of 130250251555555 in words is "one hundred thirty trillion, two hundred fifty billion, two hundred fifty-one million, five hundred fifty-five thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •