Base | Representation |
---|---|
bin | 11101110011100011111… |
… | …01011000010111010001 |
3 | 10121220102021102021110002 |
4 | 32321301331120113101 |
5 | 113234341204214213 |
6 | 2102245504015345 |
7 | 133663334332100 |
oct | 16716175302721 |
9 | 3556367367402 |
10 | 1024114132433 |
11 | 365362802567 |
12 | 146591901555 |
13 | 7575c116162 |
14 | 377d2cb2037 |
15 | 1b98d79e658 |
hex | ee71f585d1 |
1024114132433 has 12 divisors (see below), whose sum is σ = 1219021475760. Its totient is φ = 857397876552.
The previous prime is 1024114132417. The next prime is 1024114132451. The reversal of 1024114132433 is 3342314114201.
It is not a de Polignac number, because 1024114132433 - 24 = 1024114132417 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1024114132396 and 1024114132405.
It is not an unprimeable number, because it can be changed into a prime (1024114132463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 243024503 + ... + 243028716.
It is an arithmetic number, because the mean of its divisors is an integer number (101585122980).
Almost surely, 21024114132433 is an apocalyptic number.
It is an amenable number.
1024114132433 is a deficient number, since it is larger than the sum of its proper divisors (194907343327).
1024114132433 is an equidigital number, since it uses as much as digits as its factorization.
1024114132433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 486053276 (or 486053269 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 1024114132433 its reverse (3342314114201), we get a palindrome (4366428246634).
The spelling of 1024114132433 in words is "one trillion, twenty-four billion, one hundred fourteen million, one hundred thirty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •