Recognised as Number

3,474,513

Positive
Odd
Composite
7 digits

3,474,513 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value3,474,513

Digit count7

Digit sum27

Digit product5,040

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 7 × 131 × 421

Distinct prime factors43, 7, 131, 421

Number of divisors24

Sum of divisors σ(n)5,793,216

Aliquot sum2,318,703sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,965,600integers below n that share no factor with it

Carmichael function λ(n)5,460the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,965,600

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 7, 9, 21, 63, 131, 393, 421, 917, 1,179, 1,263, 2,751, 2,947, 3,789, 8,253, 8,841, 26,523, 55,151, 165,453, 386,057, 496,359, 1,158,171, 3,474,51324 in total

Arithmetic

Previous number3,474,512

Next number3,474,514

Double6,949,026

Half1,737,256.5

Square12,072,240,587,169

Cube41,945,156,859,246,323,697

Square root1,864.00456008≈irrational, shown to 9 decimal places

Cube root151.460009704≈

Negation-3,474,513

Reciprocal2.87810119 × 10^-7≈

Representations

Decimal3,474,513

Binary110101000001000101000122 bits

Octal15202121

Hexadecimal350451

Base 3622GY9

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsthree million, four hundred and seventy-four thousand, five hundred and thirteen

Ordinalthree million, four hundred and seventy-four thousand, five hundred and thirteenth

Scientific notation3.474513 × 10^6

Engineering notation3.474513 × 10^6

In other bases

Ternary20112112010200base 3; the most digit-efficient integer base after e: 14 digits

Quinary1342141023base 5; one hand: 10 digits

Septenary41350530base 7: 8 digits

Nonary6475120base 9; each digit is two ternary digits: 7 digits

Duodecimal11b6869base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits

Vigesimal11e65dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

Sexagesimal16:5:8:33base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T1TT0TTT011T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11101010000010001010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001101010000010001010001

Bit length22 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits14within that length

Bit parityeven8 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 04 51

Gray code1011111000011001111001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001101010000010001010001

64-bit0000000000000000000000000000000000000000001101010000010001010001

One's complement11111111110010101111101110101110at 32 bits, every bit flipped

Bits reversed10001010001000001010110000000000at 32 bits

Rotated left by 100000000011010100000100010100010at 32 bits, wrapping

Shifted left by 111010100000100010100010= 6,949,026, no wrap

Shifted right by 1110101000001000101000= 1,737,256, discarding the low bit

These bits as a double1.71663751 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,474,517+4

Previous prime3,474,509−4

Distance to nearest prime4

Nearest square below3,474,496

Nearest square above3,478,225

Powers & multiples

3,474,513 to the power 212,072,240,587,169

3,474,513 to the power 341,945,156,859,246,323,697

3,474,513 to the power 4145,738,992,794,490,521,887,434,561

3,474,513 to the power 5506,372,025,071,363,646,674,675,918,843,793

First ten multiples3,474,513, 6,949,026, 10,423,539, 13,898,052, 17,372,565, 20,847,078, 24,321,591, 27,796,104, 31,270,617, 34,745,130

Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 3

Divisible by 7Yes

Divisible by 8No, remainder 1

Divisible by 9Yes

Divisible by 10No, remainder 3

Divisible by 11No, remainder 9

Divisible by 12No, remainder 9

Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 1190the total stopping time

Highest value reached10,423,5403× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps3,474,513 → 10,423,540 → 5,211,770 → 2,605,885 → 7,817,656 → 3,908,828 → 1,954,414 → 977,207 → 2,931,622 → 1,465,811 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage347,451,300%

3,474,513% as a decimal34,745.13

3,474,513% of 1003,474,513

3,474,513% of 1,00034,745,130

As a fraction of 1003,474,513/100

Read another way

As seconds40 days, 5 hours and 8 minutes

As bytes3.314 MiB

As a 24-bit colour#350451

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.