Number

10,567

Positive
Odd
Prime
5 digits

10,567 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value10,567

Digit count5

Digit sum19

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation10,567

Distinct prime factors110,567

Number of divisors2

Sum of divisors σ(n)10,568

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)10,566integers below n that share no factor with it

SquarefreeYesno repeated prime factor

All divisors1, 10,5672 in total

Arithmetic

Previous number10,566

Next number10,568

Double21,134

Half5,283.5

Square111,661,489

Cube1,179,926,954,263

Square root102.795914316≈irrational, shown to 9 decimal places

Cube root21.944072822≈

Negation-10,567

Reciprocal0.0000946342≈

Representations

Decimal10,567

Binary1010010100011114 bits

Octal24507

Hexadecimal2947

Base 3685J

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsten thousand, five hundred and sixty-seven

Ordinalten thousand, five hundred and sixty-seventh

Scientific notation1.0567 × 10^4

Engineering notation10.567 × 10^3

Nearest landmarks

Next prime10,589+22

Previous prime10,559−8

Distance to nearest prime0, it is prime

Nearest square below10,404

Nearest square above10,609

Powers & multiples

10,567 to the power 2111,661,489

10,567 to the power 31,179,926,954,263

10,567 to the power 412,468,288,125,697,121

10,567 to the power 5131,752,400,624,241,477,607

First ten multiples10,567, 21,134, 31,701, 42,268, 52,835, 63,402, 73,969, 84,536, 95,103, 105,670

Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 7

Divisible by 9No, remainder 1

Divisible by 10No, remainder 7

Divisible by 11No, remainder 7

Divisible by 12No, remainder 7

Divisible by 100No, remainder 67

Collatz (3n + 1) trajectory

Steps to reach 160the total stopping time

Highest value reached304,72028× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps10,567 → 31,702 → 15,851 → 47,554 → 23,777 → 71,332 → 35,666 → 17,833 → 53,500 → 26,750 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,056,700%

10,567% as a decimal105.67

10,567% of 10010,567

10,567% of 1,000105,670

As a fraction of 10010,567/100

Read another way

As seconds2 hours, 56 minutes and 7 seconds

As bytes10.319 KiB

As a 24-bit colour#002947

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.