Base | Representation |
---|---|
bin | 101110111011101100111… |
… | …0100000011010010101101 |
3 | 211211122121110222222100210 |
4 | 1131313121310003102231 |
5 | 1321140404423242031 |
6 | 21415134542413033 |
7 | 1234011634102164 |
oct | 135673164032255 |
9 | 24748543888323 |
10 | 6450400212141 |
11 | 2067665838136 |
12 | 882169b91179 |
13 | 37a368624b72 |
14 | 1842b59003db |
15 | b2bca42c746 |
hex | 5ddd9d034ad |
6450400212141 has 8 divisors (see below), whose sum is σ = 8605525227040. Its totient is φ = 4297771002672.
The previous prime is 6450400212127. The next prime is 6450400212143. The reversal of 6450400212141 is 1412120040546.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6450400212141 - 222 = 6450396017837 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 6450400212099 and 6450400212108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6450400212143) 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, 623945326 + ... + 623955663.
It is an arithmetic number, because the mean of its divisors is an integer number (1075690653380).
Almost surely, 26450400212141 is an apocalyptic number.
It is an amenable number.
6450400212141 is a deficient number, since it is larger than the sum of its proper divisors (2155125014899).
6450400212141 is a wasteful number, since it uses less digits than its factorization.
6450400212141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1247902715.
The product of its (nonzero) digits is 7680, while the sum is 30.
Adding to 6450400212141 its reverse (1412120040546), we get a palindrome (7862520252687).
The spelling of 6450400212141 in words is "six trillion, four hundred fifty billion, four hundred million, two hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •