Base | Representation |
---|---|
bin | 101110101110010011010… |
… | …0101101001010101010001 |
3 | 211201220022222120001122212 |
4 | 1131130212211221111101 |
5 | 1320202441104312403 |
6 | 21354015250041505 |
7 | 1231642550135342 |
oct | 135344645512521 |
9 | 24656288501585 |
10 | 6421623510353 |
11 | 2056439073167 |
12 | 878678879295 |
13 | 37773082097c |
14 | 182b45b2c0c9 |
15 | b2093de24d8 |
hex | 5d726969551 |
6421623510353 has 8 divisors (see below), whose sum is σ = 6455561986368. Its totient is φ = 6387757168624.
The previous prime is 6421623510329. The next prime is 6421623510389. The reversal of 6421623510353 is 3530153261246.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6421623510353 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 6421623510353.
It is not an unprimeable number, because it can be changed into a prime (6421623590353) 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, 17855051 + ... + 18211152.
It is an arithmetic number, because the mean of its divisors is an integer number (806945248296).
Almost surely, 26421623510353 is an apocalyptic number.
It is an amenable number.
6421623510353 is a deficient number, since it is larger than the sum of its proper divisors (33938476015).
6421623510353 is a wasteful number, since it uses less digits than its factorization.
6421623510353 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36067143.
The product of its (nonzero) digits is 388800, while the sum is 41.
Adding to 6421623510353 its reverse (3530153261246), we get a palindrome (9951776771599).
The spelling of 6421623510353 in words is "six trillion, four hundred twenty-one billion, six hundred twenty-three million, five hundred ten thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •