Recognised as Number
4,265,367
- Positive
- Odd
- Composite
- 7 digits
4,265,367 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,265,367
Digit count7
Digit sum33
Digit product30,240
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 19 × 74,831
Distinct prime factors33, 19, 74,831
Number of divisors8
Sum of divisors σ(n)5,986,560
Aliquot sum1,721,193sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,693,880integers below n that share no factor with it
Carmichael function λ(n)673,470the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,693,880
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 19, 57, 74,831, 224,493, 1,421,789, 4,265,3678 in total
Arithmetic
Previous number4,265,366
Next number4,265,368
Double8,530,734
Half2,132,683.5
Square18,193,355,644,689
Cube77,601,338,786,120,185,863
Square root2,065.276494806≈irrational, shown to 9 decimal places
Cube root162.175583136≈
Negation-4,265,367
Reciprocal2.34446415 × 10^-7≈
Representations
Decimal4,265,367
Binary1000001000101011001011123 bits
Octal20212627
Hexadecimal411597
Base 362JF6F
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, two hundred and sixty-five thousand, three hundred and sixty-seven
Ordinalfour million, two hundred and sixty-five thousand, three hundred and sixty-seventh
Scientific notation4.265367 × 10^6
Engineering notation4.265367 × 10^6
In other bases
Ternary22000200222120base 3; the most digit-efficient integer base after e: 14 digits
Quinary2042442432base 5; one hand: 10 digits
Septenary51153321base 7: 8 digits
Nonary8020876base 9; each digit is two ternary digits: 7 digits
Duodecimal1518473base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal16d387base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:44:49:27base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T001T01000TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000010110101011101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010000010001010110010111
Bit length23 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits13within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes341 15 97
Gray code11000011001111101011100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010000010001010110010111
64-bit0000000000000000000000000000000000000000010000010001010110010111
One's complement11111111101111101110101001101000at 32 bits, every bit flipped
Bits reversed11101001101010001000001000000000at 32 bits
Rotated left by 100000000100000100010101100101110at 32 bits, wrapping
Shifted left by 1100000100010101100101110= 8,530,734, no wrap
Shifted right by 11000001000101011001011= 2,132,683, discarding the low bit
These bits as a double2.1073713 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,265,367 to the power 218,193,355,644,689
4,265,367 to the power 377,601,338,786,120,185,863
4,265,367 to the power 4330,998,189,614,137,098,813,906,721
4,265,367 to the power 51,411,828,755,039,883,114,756,576,868,831,607
First ten multiples4,265,367, 8,530,734, 12,796,101, 17,061,468, 21,326,835, 25,592,202, 29,857,569, 34,122,936, 38,388,303, 42,653,670
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 7
Divisible by 11No, remainder 7
Divisible by 12No, remainder 3
Divisible by 100No, remainder 67
Collatz (3n + 1) trajectory
Steps to reach 197the total stopping time
Highest value reached28,791,2326× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,265,367 → 12,796,102 → 6,398,051 → 19,194,154 → 9,597,077 → 28,791,232 → 14,395,616 → 7,197,808 → 3,598,904 → 1,799,452 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage426,536,700%
4,265,367% as a decimal42,653.67
4,265,367% of 1004,265,367
4,265,367% of 1,00042,653,670
As a fraction of 1004,265,367/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,265,367
Nerdulate something else
Nothing in mind? Surprise me · today’s page