Recognised as Number

1,050,151

Positive
Odd
Prime
7 digits

1,050,151 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,050,151

Digit count7

Digit sum13

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,050,151

Distinct prime factors11,050,151

Number of divisors2

Sum of divisors σ(n)1,050,152

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,050,150the 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,050,1512 in total

Arithmetic

Previous number1,050,150

Next number1,050,152

Double2,100,302

Half525,075.5

Square1,102,817,122,801

Cube1,158,124,504,326,592,951

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

Cube root101.644507697≈

Negation-1,050,151

Reciprocal9.52244011 × 10^-7≈

Representations

Decimal1,050,151

Binary10000000001100010011121 bits

Octal4003047

Hexadecimal100627

Base 36MIAV

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

In wordsone million, fifty thousand, one hundred and fifty-one

Ordinalone million, fifty thousand, one hundred and fifty-first

Scientific notation1.050151 × 10^6

Engineering notation1.050151 × 10^6

In other bases

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

Quinary232101101base 5; one hand: 9 digits

Septenary11632444base 7: 8 digits

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

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

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

Sexagesimal4:51:42:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100000000011000100111

Bit length21 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits14within that length

Bit parityodd7 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

Bytes310 06 27

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

At each machine width

32-bit00000000000100000000011000100111

64-bit0000000000000000000000000000000000000000000100000000011000100111

One's complement11111111111011111111100111011000at 32 bits, every bit flipped

Bits reversed11100100011000000000100000000000at 32 bits

Rotated left by 100000000001000000000110001001110at 32 bits, wrapping

Shifted left by 11000000000110001001110= 2,100,302, no wrap

Shifted right by 110000000001100010011= 525,075, discarding the low bit

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

Nearest landmarks

Next prime1,050,167+16

Previous prime1,050,139−12

Distance to nearest prime0, it is prime

Nearest square below1,048,576

Nearest square above1,050,625

Powers & multiples

1,050,151 to the power 21,102,817,122,801

1,050,151 to the power 31,158,124,504,326,592,951

1,050,151 to the power 41,216,205,606,343,075,914,085,601

1,050,151 to the power 51,277,199,533,706,787,514,252,907,975,751

First ten multiples1,050,151, 2,100,302, 3,150,453, 4,200,604, 5,250,755, 6,300,906, 7,351,057, 8,401,208, 9,451,359, 10,501,510

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 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 7

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11No, remainder 3

Divisible by 12No, remainder 7

Divisible by 100No, remainder 51

Collatz (3n + 1) trajectory

Steps to reach 1240the total stopping time

Highest value reached7,974,5927× the starting value

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

First steps1,050,151 → 3,150,454 → 1,575,227 → 4,725,682 → 2,362,841 → 7,088,524 → 3,544,262 → 1,772,131 → 5,316,394 → 2,658,197 → …

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

As a percentage & fraction

As a percentage105,015,100%

1,050,151% as a decimal10,501.51

1,050,151% of 1001,050,151

1,050,151% of 1,00010,501,510

As a fraction of 1001,050,151/100

Read another way

As seconds12 days, 3 hours and 42 minutes

As bytes1.002 MiB

As a 24-bit colour#100627

Keep nerding

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