Base | Representation |
---|---|
bin | 1000110111011001110… |
… | …0110110110010100101 |
3 | 112120010211021011000011 |
4 | 2031312130312302211 |
5 | 4443413122200201 |
6 | 153545404050221 |
7 | 14001261153250 |
oct | 2156634666245 |
9 | 476124234004 |
10 | 152311131301 |
11 | 5965a73231a |
12 | 25628833971 |
13 | 11494321084 |
14 | 752c6ba097 |
15 | 3e6694e151 |
hex | 2376736ca5 |
152311131301 has 4 divisors (see below), whose sum is σ = 174069864352. Its totient is φ = 130552398252.
The previous prime is 152311131299. The next prime is 152311131311. The reversal of 152311131301 is 103131113251.
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 152311131301 - 21 = 152311131299 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 (152311131311) 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, 10879366515 + ... + 10879366528.
It is an arithmetic number, because the mean of its divisors is an integer number (43517466088).
Almost surely, 2152311131301 is an apocalyptic number.
It is an amenable number.
152311131301 is a deficient number, since it is larger than the sum of its proper divisors (21758733051).
152311131301 is an equidigital number, since it uses as much as digits as its factorization.
152311131301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21758733050.
The product of its (nonzero) digits is 270, while the sum is 22.
Adding to 152311131301 its reverse (103131113251), we get a palindrome (255442244552).
The spelling of 152311131301 in words is "one hundred fifty-two billion, three hundred eleven million, one hundred thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •