Recognised as Number
4,267,819
- Positive
- Odd
- Prime
- 7 digits
4,267,819 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,267,819
Digit count7
Digit sum37
Digit product24,192
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation4,267,819
Distinct prime factors14,267,819
Number of divisors2
Sum of divisors σ(n)4,267,820
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,267,818integers below n that share no factor with it
Carmichael function λ(n)4,267,818the 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, 4,267,8192 in total
Arithmetic
Previous number4,267,818
Next number4,267,820
Double8,535,638
Half2,133,909.5
Square18,214,279,016,761
Cube77,735,246,059,033,914,259
Square root2,065.870034634≈irrational, shown to 9 decimal places
Cube root162.20665341≈
Negation-4,267,819
Reciprocal2.34311718 × 10^-7≈
Representations
Decimal4,267,819
Binary1000001000111110010101123 bits
Octal20217453
Hexadecimal411F2B
Base 362JH2J
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, two hundred and sixty-seven thousand, eight hundred and nineteen
Ordinalfour million, two hundred and sixty-seven thousand, eight hundred and nineteenth
Scientific notation4.267819 × 10^6
Engineering notation4.267819 × 10^6
In other bases
Ternary22000211100101base 3; the most digit-efficient integer base after e: 14 digits
Quinary2043032234base 5; one hand: 10 digits
Septenary51163423base 7: 8 digits
Nonary8024311base 9; each digit is two ternary digits: 7 digits
Duodecimal1519977base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal16d9ajbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:45:30:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T001T11100101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000010110001101111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010000010001111100101011
Bit length23 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits12within that length
Bit parityodd11 set bits, so odd; 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 1f 2b
Gray code11000011001000010111110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010000010001111100101011
64-bit0000000000000000000000000000000000000000010000010001111100101011
One's complement11111111101111101110000011010100at 32 bits, every bit flipped
Bits reversed11010100111110001000001000000000at 32 bits
Rotated left by 100000000100000100011111001010110at 32 bits, wrapping
Shifted left by 1100000100011111001010110= 8,535,638, no wrap
Shifted right by 11000001000111110010101= 2,133,909, discarding the low bit
These bits as a double2.10858275 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,267,819 to the power 218,214,279,016,761
4,267,819 to the power 377,735,246,059,033,914,259
4,267,819 to the power 4331,759,960,100,420,060,918,931,121
4,267,819 to the power 51,415,891,461,155,814,643,970,971,697,895,099
First ten multiples4,267,819, 8,535,638, 12,803,457, 17,071,276, 21,339,095, 25,606,914, 29,874,733, 34,142,552, 38,410,371, 42,678,190
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 7
Divisible by 100No, remainder 19
Collatz (3n + 1) trajectory
Steps to reach 1167the total stopping time
Highest value reached19,205,1884× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,267,819 → 12,803,458 → 6,401,729 → 19,205,188 → 9,602,594 → 4,801,297 → 14,403,892 → 7,201,946 → 3,600,973 → 10,802,920 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage426,781,900%
4,267,819% as a decimal42,678.19
4,267,819% of 1004,267,819
4,267,819% of 1,00042,678,190
As a fraction of 1004,267,819/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,267,819
Nerdulate something else
Nothing in mind? Surprise me · today’s page