Nerdulator> put something in

Recognised as Number

30,011

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

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

Factors & divisors

Prime factorisation30,011
Distinct prime factors130,011
Number of divisors2
Sum of divisors σ(n)30,012
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)30,010integers below n that share no factor with it
Carmichael function λ(n)30,010the 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, 30,0112 in total

Arithmetic

Previous number30,010
Next number30,012
Double60,022
Square root173.236832111≈irrational, shown to 9 decimal places
Cube root31.076122324≈
Negation-30,011
Reciprocal0.0000333211≈

Representations

Decimal30,011
Binary11101010011101115 bits
Octal72473
Hexadecimal753B
Base 36N5N
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty thousand and eleven
Ordinalthirty thousand and eleventh
Scientific notation3.0011 × 10^4
Engineering notation30.011 × 10^3

In other bases

Ternary1112011112base 3; the most digit-efficient integer base after e: 10 digits
Quinary1430021base 5; one hand: 7 digits
Septenary153332base 7: 6 digits
Nonary45145base 9; each digit is two ternary digits: 5 digits
Duodecimal1544bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3f0bbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal8:20:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TTTT1TTTTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011010101001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0111010100111011
Bit length15 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits5within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes275 3b
Gray code100111110100110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0111010100111011
32-bit00000000000000000111010100111011
64-bit0000000000000000000000000000000000000000000000000111010100111011
One's complement1000101011000100at 16 bits, every bit flipped
Bits reversed1101110010101110at 16 bits
Rotated left by 11110101001110110at 16 bits, wrapping
Shifted left by 11110101001110110= 60,022, no wrap
Shifted right by 111101010011101= 15,005, discarding the low bit
These bits as a double1.48274041 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime30,013+2
Previous prime29,989−22
Distance to nearest prime0, it is prime
Nearest square below29,929
Nearest square above30,276

Powers & multiples

30,011 to the power 2900,660,121
30,011 to the power 327,029,710,891,331
30,011 to the power 4811,188,653,559,734,641
30,011 to the power 524,344,582,681,981,196,311,051
First ten multiples30,011, 60,022, 90,033, 120,044, 150,055, 180,066, 210,077, 240,088, 270,099, 300,110
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 190the total stopping time
Highest value reached151,9365× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps30,011 → 90,034 → 45,017 → 135,052 → 67,526 → 33,763 → 101,290 → 50,645 → 151,936 → 75,968 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,001,100%
30,011% as a decimal300.11
30,011% of 10030,011
30,011% of 1,000300,110
As a fraction of 10030,011/100

Read another way

As bytes29.308 KiB
As a 24-bit colour#00753B

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 “30011” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.