Nerdulator> put something in

Recognised as Number

3,494,033

  • Positive
  • Odd
  • Prime
  • 7 digits

3,494,033 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,494,033
Digit count7
Digit sum26
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 factorisation3,494,033
Distinct prime factors13,494,033
Number of divisors2
Sum of divisors σ(n)3,494,034
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,494,032integers below n that share no factor with it
Carmichael function λ(n)3,494,032the 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, 3,494,0332 in total

Arithmetic

Previous number3,494,032
Next number3,494,034
Double6,988,066
Cube42,656,086,390,978,933,937
Square root1,869.233265272≈irrational, shown to 9 decimal places
Cube root151.743117008≈
Negation-3,494,033
Reciprocal2.8620222 × 10^-7≈

Representations

Decimal3,494,033
Binary110101010100001001000122 bits
Octal15250221
Hexadecimal355091
Base 3622W0H
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and ninety-four thousand and thirty-three
Ordinalthree million, four hundred and ninety-four thousand and thirty-third
Scientific notation3.494033 × 10^6
Engineering notation3.494033 × 10^6

In other bases

Ternary20120111220122base 3; the most digit-efficient integer base after e: 14 digits
Quinary1343302113base 5; one hand: 10 digits
Septenary41461454base 7: 8 digits
Nonary6514818base 9; each digit is two ternary digits: 7 digits
Duodecimal1206015base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11gf1dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:10:33:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT1TTT0T1T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101010101000110010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001101010101000010010001
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes335 50 91
Gray code1011111111100011011001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001101010101000010010001
64-bit0000000000000000000000000000000000000000001101010101000010010001
One's complement11111111110010101010111101101110at 32 bits, every bit flipped
Bits reversed10001001000010101010110000000000at 32 bits
Rotated left by 100000000011010101010000100100010at 32 bits, wrapping
Shifted left by 111010101010000100100010= 6,988,066, no wrap
Shifted right by 1110101010100001001000= 1,747,016, discarding the low bit
These bits as a double1.72628167 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,494,053+20
Previous prime3,494,017−16
Distance to nearest prime0, it is prime
Nearest square below3,493,161
Nearest square above3,496,900

Powers & multiples

3,494,033 to the power 212,208,266,605,089
3,494,033 to the power 342,656,086,390,978,933,937
3,494,033 to the power 4149,041,773,500,931,297,480,697,921
3,494,033 to the power 5520,756,874,990,779,484,130,375,399,005,393
First ten multiples3,494,033, 6,988,066, 10,482,099, 13,976,132, 17,470,165, 20,964,198, 24,458,231, 27,952,264, 31,446,297, 34,940,330
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1102the total stopping time
Highest value reached95,626,16827× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,494,033 → 10,482,100 → 5,241,050 → 2,620,525 → 7,861,576 → 3,930,788 → 1,965,394 → 982,697 → 2,948,092 → 1,474,046 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage349,403,300%
3,494,033% as a decimal34,940.33
3,494,033% of 1003,494,033
3,494,033% of 1,00034,940,330
As a fraction of 1003,494,033/100

Read another way

As bytes3.332 MiB
As a 24-bit colour#355091

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