Base | Representation |
---|---|
bin | 1011111011100100… |
… | …00110100000010111 |
3 | 121112101121120110220 |
4 | 11331302012200113 |
5 | 101104221100033 |
6 | 2535330445423 |
7 | 314504516262 |
oct | 57562064027 |
9 | 17471546426 |
10 | 6405253143 |
11 | 2797664543 |
12 | 12a9133873 |
13 | 7b1029423 |
14 | 44a97dcd9 |
15 | 2774d7bb3 |
hex | 17dc86817 |
6405253143 has 8 divisors (see below), whose sum is σ = 8660624256. Its totient is φ = 4210025400.
The previous prime is 6405253133. The next prime is 6405253147. The reversal of 6405253143 is 3413525046.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6405253143 - 29 = 6405252631 is a prime.
It is a super-2 number, since 2×64052531432 = 82054535651822756898, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6405253147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15035593 + ... + 15036018.
It is an arithmetic number, because the mean of its divisors is an integer number (1082578032).
Almost surely, 26405253143 is an apocalyptic number.
6405253143 is a deficient number, since it is larger than the sum of its proper divisors (2255371113).
6405253143 is a wasteful number, since it uses less digits than its factorization.
6405253143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30071685.
The product of its (nonzero) digits is 43200, while the sum is 33.
The square root of 6405253143 is about 80032.8254093281. The cubic root of 6405253143 is about 1857.1433722312.
Adding to 6405253143 its reverse (3413525046), we get a palindrome (9818778189).
The spelling of 6405253143 in words is "six billion, four hundred five million, two hundred fifty-three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •