Nerdulator> put something in

Recognised as Number

7,196,941

  • Positive
  • Odd
  • Prime
  • 7 digits

7,196,941 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value7,196,941
Digit count7
Digit sum37
Digit product13,608
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7,196,941
Distinct prime factors17,196,941
Number of divisors2
Sum of divisors σ(n)7,196,942
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,196,940integers below n that share no factor with it
Carmichael function λ(n)7,196,940the 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, 7,196,9412 in total

Arithmetic

Previous number7,196,940
Next number7,196,942
Cube372,772,466,412,965,065,621
Square root2,682.711501448≈irrational, shown to 9 decimal places
Cube root193.070526455≈
Negation-7,196,941
Reciprocal1.38947922 × 10^-7≈

Representations

Decimal7,196,941
Binary1101101110100010000110123 bits
Octal33350415
Hexadecimal6DD10D
Base 364A971
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, one hundred and ninety-six thousand, nine hundred and forty-one
Ordinalseven million, one hundred and ninety-six thousand, nine hundred and forty-first
Scientific notation7.196941 × 10^6
Engineering notation7.196941 × 10^6

In other bases

Ternary111112122100101base 3; the most digit-efficient integer base after e: 15 digits
Quinary3320300231base 5; one hand: 10 digits
Septenary115113223base 7: 9 digits
Nonary14478311base 9; each digit is two ternary digits: 8 digits
Duodecimal24b0a91base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal24jc71base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal33:19:9:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTTTT0T0T100101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101100101101000100011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000011011011101000100001101
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 set bits, so even; 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
Bytes36d d1 0d
Gray code10110110011100110001011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000011011011101000100001101
64-bit0000000000000000000000000000000000000000011011011101000100001101
One's complement11111111100100100010111011110010at 32 bits, every bit flipped
Bits reversed10110000100010111011011000000000at 32 bits
Rotated left by 100000000110110111010001000011010at 32 bits, wrapping
Shifted left by 1110110111010001000011010= 14,393,882, no wrap
Shifted right by 11101101110100010000110= 3,598,470, discarding the low bit
These bits as a double3.5557613 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime7,196,951+10
Previous prime7,196,909−32
Distance to nearest prime0, it is prime
Nearest square below7,193,124
Nearest square above7,198,489

Powers & multiples

7,196,941 to the power 251,795,959,757,481
7,196,941 to the power 3372,772,466,412,965,065,621
7,196,941 to the power 42,682,821,447,198,591,212,335,465,361
7,196,941 to the power 519,308,107,669,022,876,238,296,816,410,660,701
First ten multiples7,196,941, 14,393,882, 21,590,823, 28,787,764, 35,984,705, 43,181,646, 50,378,587, 57,575,528, 64,772,469, 71,969,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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 41

Collatz (3n + 1) trajectory

Steps to reach 1142the total stopping time
Highest value reached21,590,8243× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,196,941 → 21,590,824 → 10,795,412 → 5,397,706 → 2,698,853 → 8,096,560 → 4,048,280 → 2,024,140 → 1,012,070 → 506,035 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage719,694,100%
7,196,941% as a decimal71,969.41
7,196,941% of 1007,196,941
7,196,941% of 1,00071,969,410
As a fraction of 1007,196,941/100

Read another way

As bytes6.864 MiB
As a 24-bit colour#6DD10D

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