Nerdulator> put something in

Recognised as Number

70,442

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value70,442
Digit count5
Digit sum17
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 35,221
Distinct prime factors22, 35,221
Number of divisors4
Sum of divisors σ(n)105,666
Aliquot sum35,224sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)35,220integers below n that share no factor with it
Carmichael function λ(n)35,220the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 35,221, 70,4424 in total

Arithmetic

Previous number70,441
Next number70,443
Double140,884
Half35,221
Square root265.409118155≈irrational, shown to 9 decimal places
Cube root41.299414305≈
Negation-70,442
Reciprocal0.0000141961≈

Representations

Decimal70,442
Binary1000100110010101017 bits
Octal211452
Hexadecimal1132A
Base 361ICQ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy thousand, four hundred and forty-two
Ordinalseventy thousand, four hundred and forty-second
Scientific notation7.0442 × 10^4
Engineering notation70.442 × 10^3

In other bases

Ternary10120121222base 3; the most digit-efficient integer base after e: 11 digits
Quinary4223232base 5; one hand: 7 digits
Septenary412241base 7: 6 digits
Nonary116558base 9; each digit is two ternary digits: 6 digits
Duodecimal34922base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal8g22base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal19:34:2base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11TT1T0T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001011101111110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010001001100101010
Bit length17 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits10within that length
Bit parityodd7 set bits, so odd; 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 13 2a
Gray code11001101010111111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010001001100101010
64-bit0000000000000000000000000000000000000000000000010001001100101010
One's complement11111111111111101110110011010101at 32 bits, every bit flipped
Bits reversed01010100110010001000000000000000at 32 bits
Rotated left by 100000000000000100010011001010100at 32 bits, wrapping
Shifted left by 1100010011001010100= 140,884, no wrap
Shifted right by 11000100110010101= 35,221, discarding the low bit
These bits as a double3.48029722 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime70,451+9
Previous prime70,439−3
Distance to nearest prime3
Nearest square below70,225
Nearest square above70,756

Powers & multiples

70,442 to the power 24,962,075,364
70,442 to the power 3349,538,512,790,888
70,442 to the power 424,622,191,918,015,732,496
70,442 to the power 51,734,436,443,088,864,228,483,232
First ten multiples70,442, 140,884, 211,326, 281,768, 352,210, 422,652, 493,094, 563,536, 633,978, 704,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 1
Divisible by 8No, remainder 2
Divisible by 9No, remainder 8
Divisible by 10No, remainder 2
Divisible by 11No, remainder 9
Divisible by 12No, remainder 2
Divisible by 100No, remainder 42

Collatz (3n + 1) trajectory

Steps to reach 1143the total stopping time
Highest value reached105,6641× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps70,442 → 35,221 → 105,664 → 52,832 → 26,416 → 13,208 → 6,604 → 3,302 → 1,651 → 4,954 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage7,044,200%
70,442% as a decimal704.42
70,442% of 10070,442
70,442% of 1,000704,420
As a fraction of 10070,442/100

Read another way

As bytes68.791 KiB
As a 24-bit colour#01132A

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