Base | Representation |
---|---|
bin | 111101001111010… |
… | …100100011101111 |
3 | 2122121021200020221 |
4 | 331033110203233 |
5 | 4101010122133 |
6 | 245541152211 |
7 | 34313660443 |
oct | 7517244357 |
9 | 2577250227 |
10 | 1027426543 |
11 | 487a56850 |
12 | 2480bb667 |
13 | 134b20a00 |
14 | 9a64a823 |
15 | 602eca2d |
hex | 3d3d48ef |
1027426543 has 12 divisors (see below), whose sum is σ = 1213680888. Its totient is φ = 862174560.
The previous prime is 1027426523. The next prime is 1027426553. The reversal of 1027426543 is 3456247201.
It is not a de Polignac number, because 1027426543 - 217 = 1027295471 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1027426499 and 1027426508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1027426513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 274480 + ... + 278197.
It is an arithmetic number, because the mean of its divisors is an integer number (101140074).
Almost surely, 21027426543 is an apocalyptic number.
1027426543 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1027426543 is a deficient number, since it is larger than the sum of its proper divisors (186254345).
1027426543 is a wasteful number, since it uses less digits than its factorization.
1027426543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 552714 (or 552701 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 34.
The square root of 1027426543 is about 32053.4950200442. The cubic root of 1027426543 is about 1009.0598521978.
The spelling of 1027426543 in words is "one billion, twenty-seven million, four hundred twenty-six thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •