Base | Representation |
---|---|
bin | 100100011111010100001… |
… | …1001010111001011100001 |
3 | 122202102201121012202111112 |
4 | 1020332220121113023201 |
5 | 1124131311311232030 |
6 | 14355514430153105 |
7 | 1025216444056160 |
oct | 110765031271341 |
9 | 18672647182445 |
10 | 5015052055265 |
11 | 166396516345a |
12 | 68bb4a952795 |
13 | 2a4bc0638045 |
14 | 134a3087b3d7 |
15 | 8a6bddb9a95 |
hex | 48fa86572e1 |
5015052055265 has 16 divisors (see below), whose sum is σ = 6923945318400. Its totient is φ = 3415813016640.
The previous prime is 5015052055217. The next prime is 5015052055267. The reversal of 5015052055265 is 5625502505105.
It is not a de Polignac number, because 5015052055265 - 28 = 5015052055009 is a prime.
It is a super-2 number, since 2×50150520552652 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5015052055267) 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, 480824321 + ... + 480834750.
It is an arithmetic number, because the mean of its divisors is an integer number (432746582400).
Almost surely, 25015052055265 is an apocalyptic number.
It is an amenable number.
5015052055265 is a deficient number, since it is larger than the sum of its proper divisors (1908893263135).
5015052055265 is a wasteful number, since it uses less digits than its factorization.
5015052055265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 961659232.
The product of its (nonzero) digits is 375000, while the sum is 41.
The spelling of 5015052055265 in words is "five trillion, fifteen billion, fifty-two million, fifty-five thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •