Base | Representation |
---|---|
bin | 101101011111111111110… |
… | …1000100100111001000111 |
3 | 211010211021210222210000012 |
4 | 1122333333220210321013 |
5 | 1304424044324231011 |
6 | 21144445220140435 |
7 | 1213540503012446 |
oct | 132777750447107 |
9 | 24124253883005 |
10 | 6253466242631 |
11 | 1aa1097737033 |
12 | 84bb6923771b |
13 | 36491259901a |
14 | 178952ad2d5d |
15 | aca01241a8b |
hex | 5afffa24e47 |
6253466242631 has 2 divisors, whose sum is σ = 6253466242632. Its totient is φ = 6253466242630.
The previous prime is 6253466242619. The next prime is 6253466242687. The reversal of 6253466242631 is 1362426643526.
6253466242631 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 6253466242631 - 214 = 6253466226247 is a prime.
It is a super-2 number, since 2×62534662426312 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 6253466242631.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6253466242691) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3126733121315 + 3126733121316.
It is an arithmetic number, because the mean of its divisors is an integer number (3126733121316).
Almost surely, 26253466242631 is an apocalyptic number.
6253466242631 is a deficient number, since it is larger than the sum of its proper divisors (1).
6253466242631 is an equidigital number, since it uses as much as digits as its factorization.
6253466242631 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 7464960, while the sum is 50.
The spelling of 6253466242631 in words is "six trillion, two hundred fifty-three billion, four hundred sixty-six million, two hundred forty-two thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.862 sec. • engine limits •