Nerdulator> put something in

Recognised as Number

3,501,533

  • Positive
  • Odd
  • Composite
  • 7 digits

3,501,533 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,501,533
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 factorisation7 × 43 × 11,633
Distinct prime factors37, 43, 11,633
Number of divisors8
Sum of divisors σ(n)4,095,168
Aliquot sum593,635sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,931,264integers below n that share no factor with it
Carmichael function λ(n)244,272the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,931,264
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 43, 301, 11,633, 81,431, 500,219, 3,501,5338 in total

Arithmetic

Previous number3,501,532
Next number3,501,534
Double7,003,066
Cube42,931,362,429,537,186,437
Square root1,871.238360017≈irrational, shown to 9 decimal places
Cube root151.851612458≈
Negation-3,501,533
Reciprocal2.85589198 × 10^-7≈

Representations

Decimal3,501,533
Binary110101011011011101110122 bits
Octal15266735
Hexadecimal356DDD
Base 36231ST
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and one thousand, five hundred and thirty-three
Ordinalthree million, five hundred and one thousand, five hundred and thirty-third
Scientific notation3.501533 × 10^6
Engineering notation3.501533 × 10^6

In other bases

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

Bit-level

00000000001101010110110111011101
Bit length22 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits7within that length
Bit parityodd15 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 6d dd
Gray code1011111101101100110011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001101010110110111011101
64-bit0000000000000000000000000000000000000000001101010110110111011101
One's complement11111111110010101001001000100010at 32 bits, every bit flipped
Bits reversed10111011101101101010110000000000at 32 bits
Rotated left by 100000000011010101101101110111010at 32 bits, wrapping
Shifted left by 111010101101101110111010= 7,003,066, no wrap
Shifted right by 1110101011011011101110= 1,750,766, discarding the low bit
These bits as a double1.72998716 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,501,587+54
Previous prime3,501,503−30
Distance to nearest prime30
Nearest square below3,500,641
Nearest square above3,504,384

Powers & multiples

3,501,533 to the power 212,260,733,350,089
3,501,533 to the power 342,931,362,429,537,186,437
3,501,533 to the power 4150,325,582,281,984,633,036,307,921
3,501,533 to the power 5526,369,987,104,584,498,069,522,383,542,893
First ten multiples3,501,533, 7,003,066, 10,504,599, 14,006,132, 17,507,665, 21,009,198, 24,510,731, 28,012,264, 31,513,797, 35,015,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 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 2
Divisible by 12No, remainder 5
Divisible by 100No, remainder 33

Collatz (3n + 1) trajectory

Steps to reach 1190the total stopping time
Highest value reached10,504,6003× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,501,533 → 10,504,600 → 5,252,300 → 2,626,150 → 1,313,075 → 3,939,226 → 1,969,613 → 5,908,840 → 2,954,420 → 1,477,210 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage350,153,300%
3,501,533% as a decimal35,015.33
3,501,533% of 1003,501,533
3,501,533% of 1,00035,015,330
As a fraction of 1003,501,533/100

Read another way

As bytes3.339 MiB
As a 24-bit colour#356DDD

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