Recognised as Number

70,142

Positive
Even
Composite
5 digits

70,142 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 5.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value70,142

Digit count5

Digit sum14

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 numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 17 × 2,063

Distinct prime factors32, 17, 2,063

Number of divisors8

Sum of divisors σ(n)111,456

Aliquot sum41,314sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)16,496the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 32,992

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 17, 34, 2,063, 4,126, 35,071, 70,1428 in total

Arithmetic

Previous number70,141

Next number70,143

Double140,284

Half35,071

Square4,919,900,164

Cube345,091,637,303,288

Square root264.843349926≈irrational, shown to 9 decimal places

Cube root41.240701914≈

Negation-70,142

Reciprocal0.0000142568≈

Representations

Decimal70,142

Binary1000100011111111017 bits

Octal210776

Hexadecimal111FE

Base 361I4E

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

In wordsseventy thousand, one hundred and forty-two

Ordinalseventy thousand, one hundred and forty-second

Scientific notation7.0142 × 10^4

Engineering notation70.142 × 10^3

In other bases

Ternary10120012212base 3; the most digit-efficient integer base after e: 11 digits

Quinary4221032base 5; one hand: 7 digits

Septenary411332base 7: 6 digits

Nonary116185base 9; each digit is two ternary digits: 6 digits

Duodecimal34712base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimal8f72base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal19:29:2base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary11TT01T00TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary10001011000000010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010001000111111110

Bit length17 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits7within that length

Bit parityeven10 set bits, so even; not the same as the number itself being even

Highest set bitbit 16worth 65,536

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes301 11 fe

Gray code11001100100000001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010001000111111110

64-bit0000000000000000000000000000000000000000000000010001000111111110

One's complement11111111111111101110111000000001at 32 bits, every bit flipped

Bits reversed01111111100010001000000000000000at 32 bits

Rotated left by 100000000000000100010001111111100at 32 bits, wrapping

Shifted left by 1100010001111111100= 140,284, no wrap

Shifted right by 11000100011111111= 35,071, discarding the low bit

These bits as a double3.46547525 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime70,157+15

Previous prime70,141−1

Distance to nearest prime1

Nearest square below69,696

Nearest square above70,225

Powers & multiples

70,142 to the power 24,919,900,164

70,142 to the power 3345,091,637,303,288

70,142 to the power 424,205,417,623,727,226,896

70,142 to the power 51,697,816,402,963,475,148,939,232

First ten multiples70,142, 140,284, 210,426, 280,568, 350,710, 420,852, 490,994, 561,136, 631,278, 701,420

Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6No, remainder 2

Divisible by 7No, remainder 2

Divisible by 8No, remainder 6

Divisible by 9No, remainder 5

Divisible by 10No, remainder 2

Divisible by 11No, remainder 6

Divisible by 12No, remainder 2

Divisible by 100No, remainder 42

Collatz (3n + 1) trajectory

Steps to reach 168the total stopping time

Highest value reached1,797,71225× the starting value

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

First steps70,142 → 35,071 → 105,214 → 52,607 → 157,822 → 78,911 → 236,734 → 118,367 → 355,102 → 177,551 → …

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

As a percentage & fraction

As a percentage7,014,200%

70,142% as a decimal701.42

70,142% of 10070,142

70,142% of 1,000701,420

As a fraction of 10070,142/100

Read another way

As seconds19 hours, 29 minutes and 2 seconds

As bytes68.498 KiB

As a 24-bit colour#0111FE

Keep nerding

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