Base | Representation |
---|---|
bin | 1100110011010010100000… |
… | …10100111000110011011101 |
3 | 10200200011112011021120120001 |
4 | 12121221100110320303131 |
5 | 12142204323201421223 |
6 | 135512105032254301 |
7 | 5633545126043026 |
oct | 631512024706335 |
9 | 120604464246501 |
10 | 28150563310813 |
11 | 8a73650118149 |
12 | 31a7926841391 |
13 | 1292782078348 |
14 | 6d46cd003c4d |
15 | 33c3da09c9ad |
hex | 199a50538cdd |
28150563310813 has 4 divisors (see below), whose sum is σ = 28150607852320. Its totient is φ = 28150518769308.
The previous prime is 28150563310811. The next prime is 28150563310861. The reversal of 28150563310813 is 31801336505182.
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 28150563310813 - 21 = 28150563310811 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 (28150563310811) 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, 21308895 + ... + 22591372.
It is an arithmetic number, because the mean of its divisors is an integer number (7037651963080).
Almost surely, 228150563310813 is an apocalyptic number.
It is an amenable number.
28150563310813 is a deficient number, since it is larger than the sum of its proper divisors (44541507).
28150563310813 is an equidigital number, since it uses as much as digits as its factorization.
28150563310813 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44541506.
The product of its (nonzero) digits is 518400, while the sum is 46.
Adding to 28150563310813 its reverse (31801336505182), we get a palindrome (59951899815995).
The spelling of 28150563310813 in words is "twenty-eight trillion, one hundred fifty billion, five hundred sixty-three million, three hundred ten thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •