Nerdulator> put something in

Recognised as Number

3,512,653

  • Positive
  • Odd
  • Prime
  • 7 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,512,653
Digit count7
Digit sum25
Digit product2,700
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3,512,653
Distinct prime factors13,512,653
Number of divisors2
Sum of divisors σ(n)3,512,654
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,512,652integers below n that share no factor with it
Carmichael function λ(n)3,512,652the 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,512,6532 in total

Arithmetic

Previous number3,512,652
Next number3,512,654
Double7,025,306
Cube43,341,680,809,019,669,077
Square root1,874.2072991≈irrational, shown to 9 decimal places
Cube root152.012190273≈
Negation-3,512,653
Reciprocal2.84685108 × 10^-7≈

Representations

Decimal3,512,653
Binary110101100110010100110122 bits
Octal15314515
Hexadecimal35994D
Base 3623ADP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and twelve thousand, six hundred and fifty-three
Ordinalthree million, five hundred and twelve thousand, six hundred and fifty-third
Scientific notation3.512653 × 10^6
Engineering notation3.512653 × 10^6

In other bases

Ternary20121110110021base 3; the most digit-efficient integer base after e: 14 digits
Quinary1344401103base 5; one hand: 10 digits
Septenary41566654base 7: 8 digits
Nonary6543407base 9; each digit is two ternary digits: 7 digits
Duodecimal1214951base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11j1cdbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:15:44:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT11101101T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010101110100101011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001101011001100101001101
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 set bits, so even; 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 99 4d
Gray code1011110101010111101011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001101011001100101001101
64-bit0000000000000000000000000000000000000000001101011001100101001101
One's complement11111111110010100110011010110010at 32 bits, every bit flipped
Bits reversed10110010100110011010110000000000at 32 bits
Rotated left by 100000000011010110011001010011010at 32 bits, wrapping
Shifted left by 111010110011001010011010= 7,025,306, no wrap
Shifted right by 1110101100110010100110= 1,756,326, discarding the low bit
These bits as a double1.73548117 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,512,657+4
Previous prime3,512,651−2
Distance to nearest prime0, it is prime
Nearest square below3,511,876
Nearest square above3,515,625

Powers & multiples

3,512,653 to the power 212,338,731,098,409
3,512,653 to the power 343,341,680,809,019,669,077
3,512,653 to the power 4152,244,285,118,845,367,642,331,281
3,512,653 to the power 5534,781,344,855,567,537,184,937,901,198,493
First ten multiples3,512,653, 7,025,306, 10,537,959, 14,050,612, 17,563,265, 21,075,918, 24,588,571, 28,101,224, 31,613,877, 35,126,530
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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 53

Collatz (3n + 1) trajectory

Steps to reach 171the total stopping time
Highest value reached10,537,9603× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,512,653 → 10,537,960 → 5,268,980 → 2,634,490 → 1,317,245 → 3,951,736 → 1,975,868 → 987,934 → 493,967 → 1,481,902 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage351,265,300%
3,512,653% as a decimal35,126.53
3,512,653% of 1003,512,653
3,512,653% of 1,00035,126,530
As a fraction of 1003,512,653/100

Read another way

As bytes3.35 MiB
As a 24-bit colour#35994D

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