Base | Representation |
---|---|
bin | 11100000011111001… |
… | …11111101100111001 |
3 | 1102212220202000212012 |
4 | 32001330333230321 |
5 | 221323134333223 |
6 | 10530522255305 |
7 | 1042220452601 |
oct | 160174775471 |
9 | 42786660765 |
10 | 15065152313 |
11 | 6430981a02 |
12 | 2b05357535 |
13 | 15611ab213 |
14 | a2cb43c01 |
15 | 5d28d3c78 |
hex | 381f3fb39 |
15065152313 has 4 divisors (see below), whose sum is σ = 15144027648. Its totient is φ = 14986276980.
The previous prime is 15065152309. The next prime is 15065152433. The reversal of 15065152313 is 31325156051.
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 15065152313 - 22 = 15065152309 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 15065152313.
It is not an unprimeable number, because it can be changed into a prime (15065152013) 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, 39437381 + ... + 39437762.
It is an arithmetic number, because the mean of its divisors is an integer number (3786006912).
Almost surely, 215065152313 is an apocalyptic number.
It is an amenable number.
15065152313 is a deficient number, since it is larger than the sum of its proper divisors (78875335).
15065152313 is an equidigital number, since it uses as much as digits as its factorization.
15065152313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78875334.
The product of its (nonzero) digits is 13500, while the sum is 32.
The spelling of 15065152313 in words is "fifteen billion, sixty-five million, one hundred fifty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •