Base | Representation |
---|---|
bin | 111110110110101… |
… | …000000001011111 |
3 | 2201111020111210122 |
4 | 332312220001133 |
5 | 4124423211403 |
6 | 252345425155 |
7 | 35063106506 |
oct | 7666500137 |
9 | 2644214718 |
10 | 1054507103 |
11 | 4a1272881 |
12 | 25519b1bb |
13 | 13a612c00 |
14 | a009983d |
15 | 6289b838 |
hex | 3eda805f |
1054507103 has 12 divisors (see below), whose sum is σ = 1168425720. Its totient is φ = 950747616.
The previous prime is 1054507081. The next prime is 1054507109. The reversal of 1054507103 is 3017054501.
It is not a de Polignac number, because 1054507103 - 212 = 1054503007 is a prime.
It is a super-2 number, since 2×10545071032 = 2223970460554905218, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1054507109) 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 11 ways as a sum of consecutive naturals, for example, 65288 + ... + 79821.
It is an arithmetic number, because the mean of its divisors is an integer number (97368810).
Almost surely, 21054507103 is an apocalyptic number.
1054507103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1054507103 is a deficient number, since it is larger than the sum of its proper divisors (113918617).
1054507103 is a wasteful number, since it uses less digits than its factorization.
1054507103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145178 (or 145165 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 26.
The square root of 1054507103 is about 32473.1751296358. The cubic root of 1054507103 is about 1017.8485676197.
The spelling of 1054507103 in words is "one billion, fifty-four million, five hundred seven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •