Base | Representation |
---|---|
bin | 100100011111011101001… |
… | …0010000011101110001011 |
3 | 122202110111111212011021000 |
4 | 1020332322102003232023 |
5 | 1124132420121133233 |
6 | 14400004305550043 |
7 | 1025230046501004 |
oct | 110767222035613 |
9 | 18673444764230 |
10 | 5015352130443 |
11 | 1663aa9589376 |
12 | 690013345323 |
13 | 2a4c3a861115 |
14 | 134a5c6701ab |
15 | 8a6da3e0d13 |
hex | 48fba483b8b |
5015352130443 has 8 divisors (see below), whose sum is σ = 7430151304400. Its totient is φ = 3343568086944.
The previous prime is 5015352130409. The next prime is 5015352130447. The reversal of 5015352130443 is 3440312535105.
5015352130443 is a `hidden beast` number, since 5 + 0 + 153 + 52 + 13 + 0 + 443 = 666.
It is not a de Polignac number, because 5015352130443 - 212 = 5015352126347 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5015352130398 and 5015352130407.
It is not an unprimeable number, because it can be changed into a prime (5015352130447) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 92876891278 + ... + 92876891331.
It is an arithmetic number, because the mean of its divisors is an integer number (928768913050).
Almost surely, 25015352130443 is an apocalyptic number.
5015352130443 is a deficient number, since it is larger than the sum of its proper divisors (2414799173957).
5015352130443 is a wasteful number, since it uses less digits than its factorization.
5015352130443 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 185753782618 (or 185753782612 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 36.
Adding to 5015352130443 its reverse (3440312535105), we get a palindrome (8455664665548).
The spelling of 5015352130443 in words is "five trillion, fifteen billion, three hundred fifty-two million, one hundred thirty thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •