Base | Representation |
---|---|
bin | 111010110100000010… |
… | …101100000101101001 |
3 | 20001000001010210112111 |
4 | 322310002230011221 |
5 | 2013312414132042 |
6 | 45002154442321 |
7 | 4363630245346 |
oct | 726402540551 |
9 | 201001123474 |
10 | 63150145897 |
11 | 2486667a323 |
12 | 102a4a333a1 |
13 | 5c55291b47 |
14 | 30b0dc17cd |
15 | 19990a4517 |
hex | eb40ac169 |
63150145897 has 4 divisors (see below), whose sum is σ = 64092685456. Its totient is φ = 62207606340.
The previous prime is 63150145859. The next prime is 63150145913. The reversal of 63150145897 is 79854105136.
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 63150145897 - 227 = 63015928169 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 63150145897.
It is not an unprimeable number, because it can be changed into a prime (63150745897) 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, 471269679 + ... + 471269812.
It is an arithmetic number, because the mean of its divisors is an integer number (16023171364).
Almost surely, 263150145897 is an apocalyptic number.
63150145897 is a gapful number since it is divisible by the number (67) formed by its first and last digit.
It is an amenable number.
63150145897 is a deficient number, since it is larger than the sum of its proper divisors (942539559).
63150145897 is an equidigital number, since it uses as much as digits as its factorization.
63150145897 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 942539558.
The product of its (nonzero) digits is 907200, while the sum is 49.
The spelling of 63150145897 in words is "sixty-three billion, one hundred fifty million, one hundred forty-five thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •