Base | Representation |
---|---|
bin | 11100101001100100101101… |
… | …11110010111111100101111 |
3 | 22021001211212220101210110201 |
4 | 32110302112332113330233 |
5 | 31224202234441344101 |
6 | 341554151210214331 |
7 | 16161452213463424 |
oct | 1624622676277457 |
9 | 267054786353421 |
10 | 63001113231151 |
11 | 1908a692a8a927 |
12 | 70960554243a7 |
13 | 291cc96c12544 |
14 | 117b3ad413d4b |
15 | 743c0bde2e01 |
hex | 394c96f97f2f |
63001113231151 has 8 divisors (see below), whose sum is σ = 66721490457984. Its totient is φ = 59362502536920.
The previous prime is 63001113231103. The next prime is 63001113231187. The reversal of 63001113231151 is 15113231110036.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 63001113231151 - 225 = 63001079676719 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 (63001113237151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20441631565 + ... + 20441634646.
It is an arithmetic number, because the mean of its divisors is an integer number (8340186307248).
Almost surely, 263001113231151 is an apocalyptic number.
63001113231151 is a deficient number, since it is larger than the sum of its proper divisors (3720377226833).
63001113231151 is a wasteful number, since it uses less digits than its factorization.
63001113231151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40883266301.
The product of its (nonzero) digits is 1620, while the sum is 28.
Adding to 63001113231151 its reverse (15113231110036), we get a palindrome (78114344341187).
The spelling of 63001113231151 in words is "sixty-three trillion, one billion, one hundred thirteen million, two hundred thirty-one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •