Nerdulator> put something in

Recognised as Number

1,504,909

  • Positive
  • Odd
  • Composite
  • 7 digits

1,504,909 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,504,909
Digit count7
Digit sum28
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation7 × 214,987
Distinct prime factors27, 214,987
Number of divisors4
Sum of divisors σ(n)1,719,904
Aliquot sum214,995sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,289,916integers below n that share no factor with it
Carmichael function λ(n)214,986the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,289,916
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 214,987, 1,504,9094 in total

Arithmetic

Previous number1,504,908
Next number1,504,910
Double3,009,818
Cube3,408,244,310,562,961,429
Square root1,226.747325247≈irrational, shown to 9 decimal places
Cube root114.596163882≈
Negation-1,504,909
Reciprocal6.64492006 × 10^-7≈

Representations

Decimal1,504,909
Binary10110111101101000110121 bits
Octal5573215
Hexadecimal16F68D
Base 36W971
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, five hundred and four thousand, nine hundred and nine
Ordinalone million, five hundred and four thousand, nine hundred and ninth
Scientific notation1.504909 × 10^6
Engineering notation1.504909 × 10^6

In other bases

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

Bit-level

00000000000101101111011010001101
Bit length21 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits8within that length
Bit parityodd13 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 f6 8d
Gray code111011000110111001011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101101111011010001101
64-bit0000000000000000000000000000000000000000000101101111011010001101
One's complement11111111111010010000100101110010at 32 bits, every bit flipped
Bits reversed10110001011011110110100000000000at 32 bits
Rotated left by 100000000001011011110110100011010at 32 bits, wrapping
Shifted left by 11011011110110100011010= 3,009,818, no wrap
Shifted right by 110110111101101000110= 752,454, discarding the low bit
These bits as a double7.43523837 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,504,949+40
Previous prime1,504,907−2
Distance to nearest prime2
Nearest square below1,503,076
Nearest square above1,505,529

Powers & multiples

1,504,909 to the power 22,264,751,098,281
1,504,909 to the power 33,408,244,310,562,961,429
1,504,909 to the power 45,129,097,537,164,995,721,154,961
1,504,909 to the power 57,718,825,045,557,436,545,727,591,203,549
First ten multiples1,504,909, 3,009,818, 4,514,727, 6,019,636, 7,524,545, 9,029,454, 10,534,363, 12,039,272, 13,544,181, 15,049,090
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 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 9

Collatz (3n + 1) trajectory

Steps to reach 1132the total stopping time
Highest value reached4,514,7283× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,504,909 → 4,514,728 → 2,257,364 → 1,128,682 → 564,341 → 1,693,024 → 846,512 → 423,256 → 211,628 → 105,814 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage150,490,900%
1,504,909% as a decimal15,049.09
1,504,909% of 1001,504,909
1,504,909% of 1,00015,049,090
As a fraction of 1001,504,909/100

Read another way

As bytes1.435 MiB
As a 24-bit colour#16F68D

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 “1504909” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.