Nerdulator> put something in

Recognised as Number

30,013

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

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

Factors & divisors

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

Arithmetic

Previous number30,012
Next number30,014
Double60,026
Square root173.24260446≈irrational, shown to 9 decimal places
Cube root31.076812636≈
Negation-30,013
Reciprocal0.0000333189≈

Representations

Decimal30,013
Binary11101010011110115 bits
Octal72475
Hexadecimal753D
Base 36N5P
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty thousand and thirteen
Ordinalthirty thousand and thirteenth
Scientific notation3.0013 × 10^4
Engineering notation30.013 × 10^3

In other bases

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

Bit-level

0111010100111101
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 3d
Gray code100111110100011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0111010100111101
32-bit00000000000000000111010100111101
64-bit0000000000000000000000000000000000000000000000000111010100111101
One's complement1000101011000010at 16 bits, every bit flipped
Bits reversed1011110010101110at 16 bits
Rotated left by 11110101001111010at 16 bits, wrapping
Shifted left by 11110101001111010= 60,026, no wrap
Shifted right by 111101010011110= 15,006, discarding the low bit
These bits as a double1.48283922 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime30,029+16
Previous prime30,011−2
Distance to nearest prime0, it is prime
Nearest square below29,929
Nearest square above30,276

Powers & multiples

30,013 to the power 2900,780,169
30,013 to the power 327,035,115,212,197
30,013 to the power 4811,404,912,863,668,561
30,013 to the power 524,352,695,649,777,284,521,293
First ten multiples30,013, 60,026, 90,039, 120,052, 150,065, 180,078, 210,091, 240,104, 270,117, 300,130
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 164the total stopping time
Highest value reached90,0403× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps30,013 → 90,040 → 45,020 → 22,510 → 11,255 → 33,766 → 16,883 → 50,650 → 25,325 → 75,976 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,001,300%
30,013% as a decimal300.13
30,013% of 10030,013
30,013% of 1,000300,130
As a fraction of 10030,013/100

Read another way

As bytes29.31 KiB
As a 24-bit colour#00753D

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