Recognised as Number

1,149,601

Positive
Odd
Prime
7 digits

1,149,601 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,149,601

Digit count7

Digit sum22

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation1,149,601

Distinct prime factors11,149,601

Number of divisors2

Sum of divisors σ(n)1,149,602

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,149,600integers below n that share no factor with it

Carmichael function λ(n)1,149,600the 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, 1,149,6012 in total

Arithmetic

Previous number1,149,600

Next number1,149,602

Double2,299,202

Half574,800.5

Square1,321,582,459,201

Cube1,519,292,516,679,928,801

Square root1,072.194478628≈irrational, shown to 9 decimal places

Cube root104.756837158≈

Negation-1,149,601

Reciprocal8.69867023 × 10^-7≈

Representations

Decimal1,149,601

Binary10001100010101010000121 bits

Octal4305241

Hexadecimal118AA1

Base 36ON1D

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsone million, one hundred and forty-nine thousand, six hundred and one

Ordinalone million, one hundred and forty-nine thousand, six hundred and first

Scientific notation1.149601 × 10^6

Engineering notation1.149601 × 10^6

In other bases

Ternary2011101221211base 3; the most digit-efficient integer base after e: 13 digits

Quinary243241401base 5; one hand: 9 digits

Septenary12525415base 7: 8 digits

Nonary2141854base 9; each digit is two ternary digits: 7 digits

Duodecimal475341base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimal73e01base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal5:19:20:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T01111T00TT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary101101001111111100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000100011000101010100001

Bit length21 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits13within that length

Bit parityeven8 set bits, so even; 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

Bytes311 8a a1

Gray code110010100111111110001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000100011000101010100001

64-bit0000000000000000000000000000000000000000000100011000101010100001

One's complement11111111111011100111010101011110at 32 bits, every bit flipped

Bits reversed10000101010100011000100000000000at 32 bits

Rotated left by 100000000001000110001010101000010at 32 bits, wrapping

Shifted left by 11000110001010101000010= 2,299,202, no wrap

Shifted right by 110001100010101010000= 574,800, discarding the low bit

These bits as a double5.67978361 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,149,607+6

Previous prime1,149,593−8

Distance to nearest prime0, it is prime

Nearest square below1,149,184

Nearest square above1,151,329

Powers & multiples

1,149,601 to the power 21,321,582,459,201

1,149,601 to the power 31,519,292,516,679,928,801

1,149,601 to the power 41,746,580,196,467,762,829,558,401

1,149,601 to the power 52,007,870,340,439,536,616,623,167,348,001

First ten multiples1,149,601, 2,299,202, 3,448,803, 4,598,404, 5,748,005, 6,897,606, 8,047,207, 9,196,808, 10,346,409, 11,496,010

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 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 5

Divisible by 8No, remainder 1

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11No, remainder 2

Divisible by 12No, remainder 1

Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 1147the total stopping time

Highest value reached3,682,8883× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps1,149,601 → 3,448,804 → 1,724,402 → 862,201 → 2,586,604 → 1,293,302 → 646,651 → 1,939,954 → 969,977 → 2,909,932 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage114,960,100%

1,149,601% as a decimal11,496.01

1,149,601% of 1001,149,601

1,149,601% of 1,00011,496,010

As a fraction of 1001,149,601/100

Read another way

As seconds13 days, 7 hours and 20 minutes

As bytes1.096 MiB

As a 24-bit colour#118AA1

Keep nerding

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