Base | Representation |
---|---|
bin | 11100110011010010111001… |
… | …00010111110111001101111 |
3 | 22022020210001211111011211002 |
4 | 32121221130202332321233 |
5 | 31300140331421434411 |
6 | 342411432320150515 |
7 | 16224545551654640 |
oct | 1631513442767157 |
9 | 268223054434732 |
10 | 63335140421231 |
11 | 191a9311695718 |
12 | 712a93646843b |
13 | 294562a557943 |
14 | 118d6197916c7 |
15 | 74c75ba2233b |
hex | 399a5c8bee6f |
63335140421231 has 8 divisors (see below), whose sum is σ = 72385608228864. Its totient is φ = 54285320264760.
The previous prime is 63335140421209. The next prime is 63335140421243. The reversal of 63335140421231 is 13212404153336.
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 63335140421231 - 218 = 63335140159087 is a prime.
It is a super-2 number, since 2×633351404212312 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (63335140421831) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 161703215 + ... + 162094416.
It is an arithmetic number, because the mean of its divisors is an integer number (9048201028608).
Almost surely, 263335140421231 is an apocalyptic number.
63335140421231 is a deficient number, since it is larger than the sum of its proper divisors (9050467807633).
63335140421231 is a wasteful number, since it uses less digits than its factorization.
63335140421231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 323825581.
The product of its (nonzero) digits is 155520, while the sum is 38.
Adding to 63335140421231 its reverse (13212404153336), we get a palindrome (76547544574567).
The spelling of 63335140421231 in words is "sixty-three trillion, three hundred thirty-five billion, one hundred forty million, four hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •