Base | Representation |
---|---|
bin | 10111010000110011100111… |
… | …11010000111011011111111 |
3 | 20201010101000021001010200110 |
4 | 23220121303322013123333 |
5 | 23201110422302010030 |
6 | 300444141313201103 |
7 | 13526553500030652 |
oct | 1350316372073377 |
9 | 221111007033613 |
10 | 51155005110015 |
11 | 1533279685a394 |
12 | 58a2223860193 |
13 | 2270b86198711 |
14 | c8bcb6033899 |
15 | 5da9d45bb1b0 |
hex | 2e8673e876ff |
51155005110015 has 32 divisors (see below), whose sum is σ = 82045271750400. Its totient is φ = 27216917925120.
The previous prime is 51155005109953. The next prime is 51155005110023. The reversal of 51155005110015 is 51001150055115.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-51155005110015 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 405250260 + ... + 405376470.
It is an arithmetic number, because the mean of its divisors is an integer number (2563914742200).
Almost surely, 251155005110015 is an apocalyptic number.
51155005110015 is a deficient number, since it is larger than the sum of its proper divisors (30890266640385).
51155005110015 is a wasteful number, since it uses less digits than its factorization.
51155005110015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191127.
The product of its (nonzero) digits is 3125, while the sum is 30.
The spelling of 51155005110015 in words is "fifty-one trillion, one hundred fifty-five billion, five million, one hundred ten thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •