Nerdulator> put something in

Recognised as Number

10,181

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value10,181
Digit count5
Digit sum11
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation10,181
Distinct prime factors110,181
Number of divisors2
Sum of divisors σ(n)10,182
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)10,180integers below n that share no factor with it
Carmichael function λ(n)10,180the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 10,1812 in total

Arithmetic

Previous number10,180
Next number10,182
Double20,362
Square root100.900941522≈irrational, shown to 9 decimal places
Cube root21.67355468≈
Negation-10,181
Reciprocal0.0000982222≈

Representations

Decimal10,181
Binary1001111100010114 bits
Octal23705
Hexadecimal27C5
Base 367UT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsten thousand, one hundred and eighty-one
Ordinalten thousand, one hundred and eighty-first
Scientific notation1.0181 × 10^4
Engineering notation10.181 × 10^3

In other bases

Ternary111222002base 3; the most digit-efficient integer base after e: 9 digits
Quinary311211base 5; one hand: 6 digits
Septenary41453base 7: 5 digits
Nonary14862base 9; each digit is two ternary digits: 5 digits
Duodecimal5a85base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1591base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal2:49:41base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TTT00T01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111100011000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0010011111000101
Bit length14 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits6within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 13worth 8,192
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes227 c5
Gray code11010000100111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0010011111000101
32-bit00000000000000000010011111000101
64-bit0000000000000000000000000000000000000000000000000010011111000101
One's complement1101100000111010at 16 bits, every bit flipped
Bits reversed1010001111100100at 16 bits
Rotated left by 10100111110001010at 16 bits, wrapping
Shifted left by 1100111110001010= 20,362, no wrap
Shifted right by 11001111100010= 5,090, discarding the low bit
These bits as a double5.03008234 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime10,193+12
Previous prime10,177−4
Distance to nearest prime0, it is prime
Nearest square below10,000
Nearest square above10,201

Powers & multiples

10,181 to the power 2103,652,761
10,181 to the power 31,055,288,759,741
10,181 to the power 410,743,894,862,923,121
10,181 to the power 5109,383,593,599,420,294,901
First ten multiples10,181, 20,362, 30,543, 40,724, 50,905, 61,086, 71,267, 81,448, 91,629, 101,810
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 81

Collatz (3n + 1) trajectory

Steps to reach 142the total stopping time
Highest value reached30,5443× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps10,181 → 30,544 → 15,272 → 7,636 → 3,818 → 1,909 → 5,728 → 2,864 → 1,432 → 716 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,018,100%
10,181% as a decimal101.81
10,181% of 10010,181
10,181% of 1,000101,810
As a fraction of 10010,181/100

Read another way

As bytes9.942 KiB
As a 24-bit colour#0027C5

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “10181” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.