Nerdulator> put something in

Recognised as Number

1,449,769

  • Positive
  • Odd
  • Composite
  • 7 digits

1,449,769 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 value1,449,769
Digit count7
Digit sum40
Digit product54,432
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation571 × 2,539
Distinct prime factors2571, 2,539
Number of divisors4
Sum of divisors σ(n)1,452,880
Aliquot sum3,111sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,446,660integers below n that share no factor with it
Carmichael function λ(n)241,110the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,446,660
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 571, 2,539, 1,449,7694 in total

Arithmetic

Previous number1,449,768
Next number1,449,770
Double2,899,538
Cube3,047,168,199,608,023,609
Square root1,204.06353653≈irrational, shown to 9 decimal places
Cube root113.179108757≈
Negation-1,449,769
Reciprocal6.89765059 × 10^-7≈

Representations

Decimal1,449,769
Binary10110000111110010100121 bits
Octal5417451
Hexadecimal161F29
Base 36V2ND
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and forty-nine thousand, seven hundred and sixty-nine
Ordinalone million, four hundred and forty-nine thousand, seven hundred and sixty-ninth
Scientific notation1.449769 × 10^6
Engineering notation1.449769 × 10^6

In other bases

Ternary2201122201011base 3; the most digit-efficient integer base after e: 13 digits
Quinary332343034base 5; one hand: 9 digits
Septenary15215506base 7: 8 digits
Nonary2648634base 9; each digit is two ternary digits: 7 digits
Duodecimal59aba1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal91489base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:42:42:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T1TT00T01011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010100110001101111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000101100001111100101001
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes316 1f 29
Gray code111010001000010111101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101100001111100101001
64-bit0000000000000000000000000000000000000000000101100001111100101001
One's complement11111111111010011110000011010110at 32 bits, every bit flipped
Bits reversed10010100111110000110100000000000at 32 bits
Rotated left by 100000000001011000011111001010010at 32 bits, wrapping
Shifted left by 11011000011111001010010= 2,899,538, no wrap
Shifted right by 110110000111110010100= 724,884, discarding the low bit
These bits as a double7.16281057 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,449,779+10
Previous prime1,449,733−36
Distance to nearest prime10
Nearest square below1,449,616
Nearest square above1,452,025

Powers & multiples

1,449,769 to the power 22,101,830,153,361
1,449,769 to the power 33,047,168,199,608,023,609
1,449,769 to the power 44,417,689,993,577,524,779,596,321
1,449,769 to the power 56,404,630,004,298,894,522,190,578,699,849
First ten multiples1,449,769, 2,899,538, 4,349,307, 5,799,076, 7,248,845, 8,698,614, 10,148,383, 11,598,152, 13,047,921, 14,497,690
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 69

Collatz (3n + 1) trajectory

Steps to reach 1212the total stopping time
Highest value reached16,513,79211× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,449,769 → 4,349,308 → 2,174,654 → 1,087,327 → 3,261,982 → 1,630,991 → 4,892,974 → 2,446,487 → 7,339,462 → 3,669,731 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage144,976,900%
1,449,769% as a decimal14,497.69
1,449,769% of 1001,449,769
1,449,769% of 1,00014,497,690
As a fraction of 1001,449,769/100

Read another way

As bytes1.383 MiB
As a 24-bit colour#161F29

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “1449769” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.