Nerdulator> put something in

Recognised as Number

7,001,741

  • Positive
  • Odd
  • Composite
  • 7 digits

7,001,741 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value7,001,741
Digit count7
Digit sum20
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 factorisation1,459 × 4,799
Distinct prime factors21,459, 4,799
Number of divisors4
Sum of divisors σ(n)7,008,000
Aliquot sum6,259sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,995,484integers below n that share no factor with it
Carmichael function λ(n)3,497,742the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 6,995,484
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,459, 4,799, 7,001,7414 in total

Arithmetic

Previous number7,001,740
Next number7,001,742
Cube343,255,990,657,978,112,021
Square root2,646.080308683≈irrational, shown to 9 decimal places
Cube root191.308976073≈
Negation-7,001,741
Reciprocal1.42821621 × 10^-7≈

Representations

Decimal7,001,741
Binary1101010110101101000110123 bits
Octal32553215
Hexadecimal6AD68D
Base 36462KT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, one thousand, seven hundred and forty-one
Ordinalseven million, one thousand, seven hundred and forty-first
Scientific notation7.001741 × 10^6
Engineering notation7.001741 × 10^6

In other bases

Ternary111011201120202base 3; the most digit-efficient integer base after e: 15 digits
Quinary3243023431base 5; one hand: 10 digits
Septenary113341145base 7: 9 digits
Nonary14151522base 9; each digit is two ternary digits: 8 digits
Duodecimal2417b25base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal23f471base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal32:24:55:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1111TTT1TTT1T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101111110010101110011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000011010101101011010001101
Bit length23 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits10within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes36a d6 8d
Gray code10111111011110111001011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000011010101101011010001101
64-bit0000000000000000000000000000000000000000011010101101011010001101
One's complement11111111100101010010100101110010at 32 bits, every bit flipped
Bits reversed10110001011010110101011000000000at 32 bits
Rotated left by 100000000110101011010110100011010at 32 bits, wrapping
Shifted left by 1110101011010110100011010= 14,003,482, no wrap
Shifted right by 11101010110101101000110= 3,500,870, discarding the low bit
These bits as a double3.45931969 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime7,001,767+26
Previous prime7,001,723−18
Distance to nearest prime18
Nearest square below7,001,316
Nearest square above7,006,609

Powers & multiples

7,001,741 to the power 249,024,377,031,081
7,001,741 to the power 3343,255,990,657,978,112,021
7,001,741 to the power 42,403,389,543,285,582,324,040,028,561
7,001,741 to the power 516,827,911,104,193,936,467,106,353,616,724,701
First ten multiples7,001,741, 14,003,482, 21,005,223, 28,006,964, 35,008,705, 42,010,446, 49,012,187, 56,013,928, 63,015,669, 70,017,410
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)

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 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 41

Collatz (3n + 1) trajectory

Steps to reach 1266the total stopping time
Highest value reached21,005,2243× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,001,741 → 21,005,224 → 10,502,612 → 5,251,306 → 2,625,653 → 7,876,960 → 3,938,480 → 1,969,240 → 984,620 → 492,310 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage700,174,100%
7,001,741% as a decimal70,017.41
7,001,741% of 1007,001,741
7,001,741% of 1,00070,017,410
As a fraction of 1007,001,741/100

Read another way

As bytes6.677 MiB
As a 24-bit colour#6AD68D

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