Base | Representation |
---|---|
bin | 100100100011111101000… |
… | …1111110100110100000111 |
3 | 122210101102221200001012210 |
4 | 1021013322033310310013 |
5 | 1124312212344042021 |
6 | 14404243215314503 |
7 | 1026021363431115 |
oct | 111077217646407 |
9 | 18711387601183 |
10 | 5025015221511 |
11 | 16681080aa74a |
12 | 691a6b51ba33 |
13 | 2a5b1a7c9b9c |
14 | 1352d7b72ab5 |
15 | 8aaa38ede76 |
hex | 491fa3f4d07 |
5025015221511 has 8 divisors (see below), whose sum is σ = 6881101925104. Its totient is φ = 3259469332800.
The previous prime is 5025015221449. The next prime is 5025015221539. The reversal of 5025015221511 is 1151225105205.
5025015221511 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5025015221511 - 219 = 5025014697223 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5025015221581) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22635203590 + ... + 22635203811.
It is an arithmetic number, because the mean of its divisors is an integer number (860137740638).
Almost surely, 25025015221511 is an apocalyptic number.
5025015221511 is a deficient number, since it is larger than the sum of its proper divisors (1856086703593).
5025015221511 is a wasteful number, since it uses less digits than its factorization.
5025015221511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45270407441.
The product of its (nonzero) digits is 5000, while the sum is 30.
The spelling of 5025015221511 in words is "five trillion, twenty-five billion, fifteen million, two hundred twenty-one thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.072 sec. • engine limits •