Base | Representation |
---|---|
bin | 100101100000100000101… |
… | …0010011011110000000101 |
3 | 200020211002201112110111111 |
4 | 1023001001102123300011 |
5 | 1133430023330402001 |
6 | 14544111115005021 |
7 | 1041304044630520 |
oct | 113010122336005 |
9 | 20224081473444 |
10 | 5155056106501 |
11 | 1708279864324 |
12 | 6b3101a39771 |
13 | 2b5172cb8002 |
14 | 13b712841bb7 |
15 | 8e16513b851 |
hex | 4b04149bc05 |
5155056106501 has 4 divisors (see below), whose sum is σ = 5891492693152. Its totient is φ = 4418619519852.
The previous prime is 5155056106463. The next prime is 5155056106537. The reversal of 5155056106501 is 1056016505515.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5155056106501 - 27 = 5155056106373 is a prime.
It is a super-2 number, since 2×51550561065012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5155056106001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 368218293315 + ... + 368218293328.
It is an arithmetic number, because the mean of its divisors is an integer number (1472873173288).
Almost surely, 25155056106501 is an apocalyptic number.
It is an amenable number.
5155056106501 is a deficient number, since it is larger than the sum of its proper divisors (736436586651).
5155056106501 is an equidigital number, since it uses as much as digits as its factorization.
5155056106501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 736436586650.
The product of its (nonzero) digits is 112500, while the sum is 40.
The spelling of 5155056106501 in words is "five trillion, one hundred fifty-five billion, fifty-six million, one hundred six thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •