Recognised as Number
4,274,452
- Positive
- Even
- Composite
- 7 digits
4,274,452 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value4,274,452
Digit count7
Digit sum28
Digit product8,960
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 7 × 13 × 11,743
Distinct prime factors42, 7, 13, 11,743
Number of divisors24
Sum of divisors σ(n)9,207,296
Aliquot sum4,932,844sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,690,848integers below n that share no factor with it
Carmichael function λ(n)23,484the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,690,848
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 7, 13, 14, 26, 28, 52, 91, 182, 364, 11,743, 23,486, 46,972, 82,201, 152,659, 164,402, 305,318, 328,804, 610,636, 1,068,613, 2,137,226, 4,274,45224 in total
Arithmetic
Previous number4,274,451
Next number4,274,453
Double8,548,904
Half2,137,226
Square18,270,939,900,304
Cube78,098,255,598,734,233,408
Square root2,067.474788238≈irrational, shown to 9 decimal places
Cube root162.290643212≈
Negation-4,274,452
Reciprocal2.33948118 × 10^-7≈
Representations
Decimal4,274,452
Binary1000001001110010001010023 bits
Octal20234424
Hexadecimal413914
Base 362JM6S
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, two hundred and seventy-four thousand, four hundred and fifty-two
Ordinalfour million, two hundred and seventy-four thousand, four hundred and fifty-second
Scientific notation4.274452 × 10^6
Engineering notation4.274452 × 10^6
In other bases
Ternary22001011110001base 3; the most digit-efficient integer base after e: 14 digits
Quinary2043240302base 5; one hand: 10 digits
Septenary51221650base 7: 8 digits
Nonary8034401base 9; each digit is two ternary digits: 7 digits
Duodecimal1521784base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal16e62cbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:47:20:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T001011110001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000010100100100010100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010000010011100100010100
Bit length23 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits15within that length
Bit parityeven8 set bits, so even; not the same as the number itself being even
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes341 39 14
Gray code11000011010010110011110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010000010011100100010100
64-bit0000000000000000000000000000000000000000010000010011100100010100
One's complement11111111101111101100011011101011at 32 bits, every bit flipped
Bits reversed00101000100111001000001000000000at 32 bits
Rotated left by 100000000100000100111001000101000at 32 bits, wrapping
Shifted left by 1100000100111001000101000= 8,548,904, no wrap
Shifted right by 11000001001110010001010= 2,137,226, discarding the low bit
These bits as a double2.11185989 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,274,452 to the power 218,270,939,900,304
4,274,452 to the power 378,098,255,598,734,233,408
4,274,452 to the power 4333,827,244,840,520,741,459,292,416
4,274,452 to the power 51,426,928,534,363,053,564,372,155,386,156,032
First ten multiples4,274,452, 8,548,904, 12,823,356, 17,097,808, 21,372,260, 25,646,712, 29,921,164, 34,195,616, 38,470,068, 42,744,520
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7Yes
Divisible by 8No, remainder 4
Divisible by 9No, remainder 1
Divisible by 10No, remainder 2
Divisible by 11No, remainder 6
Divisible by 12No, remainder 4
Divisible by 100No, remainder 52
Collatz (3n + 1) trajectory
Steps to reach 179the total stopping time
Highest value reached4,274,452
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,274,452 → 2,137,226 → 1,068,613 → 3,205,840 → 1,602,920 → 801,460 → 400,730 → 200,365 → 601,096 → 300,548 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage427,445,200%
4,274,452% as a decimal42,744.52
4,274,452% of 1004,274,452
4,274,452% of 1,00042,744,520
As a fraction of 1004,274,452/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 4,274,452
Nerdulate something else
Nothing in mind? Surprise me · today’s page