Recognised as Number
4,273,699
- Positive
- Odd
- Composite
- 7 digits
4,273,699 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,273,699
Digit count7
Digit sum40
Digit product81,648
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation23 × 185,813
Distinct prime factors223, 185,813
Number of divisors4
Sum of divisors σ(n)4,459,536
Aliquot sum185,837sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,087,864integers below n that share no factor with it
Carmichael function λ(n)185,812the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,087,864
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 23, 185,813, 4,273,6994 in total
Arithmetic
Previous number4,273,698
Next number4,273,700
Double8,547,398
Half2,136,849.5
Square18,264,503,142,601
Cube78,056,988,816,030,751,099
Square root2,067.292674006≈irrational, shown to 9 decimal places
Cube root162.281112787≈
Negation-4,273,699
Reciprocal2.33989338 × 10^-7≈
Representations
Decimal4,273,699
Binary1000001001101100010001123 bits
Octal20233043
Hexadecimal413623
Base 362JLLV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, two hundred and seventy-three thousand, six hundred and ninety-nine
Ordinalfour million, two hundred and seventy-three thousand, six hundred and ninety-ninth
Scientific notation4.273699 × 10^6
Engineering notation4.273699 × 10^6
In other bases
Ternary22001010102011base 3; the most digit-efficient integer base after e: 14 digits
Quinary2043224244base 5; one hand: 10 digits
Septenary51216523base 7: 8 digits
Nonary8033364base 9; each digit is two ternary digits: 7 digits
Duodecimal1521257base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal16e44jbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:47:8:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T00101011T011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000010100101001100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010000010011011000100011
Bit length23 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits14within that length
Bit parityodd9 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 36 23
Gray code11000011010110100110010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010000010011011000100011
64-bit0000000000000000000000000000000000000000010000010011011000100011
One's complement11111111101111101100100111011100at 32 bits, every bit flipped
Bits reversed11000100011011001000001000000000at 32 bits
Rotated left by 100000000100000100110110001000110at 32 bits, wrapping
Shifted left by 1100000100110110001000110= 8,547,398, no wrap
Shifted right by 11000001001101100010001= 2,136,849, discarding the low bit
These bits as a double2.11148786 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,273,699 to the power 218,264,503,142,601
4,273,699 to the power 378,056,988,816,030,751,099
4,273,699 to the power 4333,592,075,046,081,804,941,045,201
4,273,699 to the power 51,425,672,117,532,364,763,694,739,934,468,499
First ten multiples4,273,699, 8,547,398, 12,821,097, 17,094,796, 21,368,495, 25,642,194, 29,915,893, 34,189,592, 38,463,291, 42,736,990
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 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 99
Collatz (3n + 1) trajectory
Steps to reach 1123the total stopping time
Highest value reached19,231,6484× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,273,699 → 12,821,098 → 6,410,549 → 19,231,648 → 9,615,824 → 4,807,912 → 2,403,956 → 1,201,978 → 600,989 → 1,802,968 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage427,369,900%
4,273,699% as a decimal42,736.99
4,273,699% of 1004,273,699
4,273,699% of 1,00042,736,990
As a fraction of 1004,273,699/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,273,699
Nerdulate something else
Nothing in mind? Surprise me · today’s page