Recognised as Number

1,455,351

Positive
Odd
Composite
7 digits

1,455,351 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,455,351

Digit count7

Digit sum24

Digit product1,500

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 137 × 3,541

Distinct prime factors33, 137, 3,541

Number of divisors8

Sum of divisors σ(n)1,955,184

Aliquot sum499,833sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)962,880integers below n that share no factor with it

Carmichael function λ(n)120,360the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 962,880

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 137, 411, 3,541, 10,623, 485,117, 1,455,3518 in total

Arithmetic

Previous number1,455,350

Next number1,455,352

Double2,910,702

Half727,675.5

Square2,118,046,533,201

Cube3,082,501,140,140,608,551

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

Cube root113.324179384≈

Negation-1,455,351

Reciprocal6.87119465 × 10^-7≈

Representations

Decimal1,455,351

Binary10110001101001111011121 bits

Octal5432367

Hexadecimal1634F7

Base 36V6YF

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

In wordsone million, four hundred and fifty-five thousand, three hundred and fifty-one

Ordinalone million, four hundred and fifty-five thousand, three hundred and fifty-first

Scientific notation1.455351 × 10^6

Engineering notation1.455351 × 10^6

In other bases

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

Quinary333032401base 5; one hand: 9 digits

Septenary15241002base 7: 8 digits

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

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

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

Sexagesimal6:44:15:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101100011010011110111

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 34 f7

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

At each machine width

32-bit00000000000101100011010011110111

64-bit0000000000000000000000000000000000000000000101100011010011110111

One's complement11111111111010011100101100001000at 32 bits, every bit flipped

Bits reversed11101111001011000110100000000000at 32 bits

Rotated left by 100000000001011000110100111101110at 32 bits, wrapping

Shifted left by 11011000110100111101110= 2,910,702, no wrap

Shifted right by 110110001101001111011= 727,675, discarding the low bit

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

Nearest landmarks

Next prime1,455,359+8

Previous prime1,455,341−10

Distance to nearest prime8

Nearest square below1,454,436

Nearest square above1,456,849

Powers & multiples

1,455,351 to the power 22,118,046,533,201

1,455,351 to the power 33,082,501,140,140,608,551

1,455,351 to the power 44,486,121,116,804,774,795,306,401

1,455,351 to the power 56,528,880,853,462,945,803,123,966,001,751

First ten multiples1,455,351, 2,910,702, 4,366,053, 5,821,404, 7,276,755, 8,732,106, 10,187,457, 11,642,808, 13,098,159, 14,553,510

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 2

Divisible by 8No, remainder 7

Divisible by 9No, remainder 6

Divisible by 10No, remainder 1

Divisible by 11No, remainder 7

Divisible by 12No, remainder 3

Divisible by 100No, remainder 51

Collatz (3n + 1) trajectory

Steps to reach 1137the total stopping time

Highest value reached9,823,6246× the starting value

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

First steps1,455,351 → 4,366,054 → 2,183,027 → 6,549,082 → 3,274,541 → 9,823,624 → 4,911,812 → 2,455,906 → 1,227,953 → 3,683,860 → …

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

As a percentage & fraction

As a percentage145,535,100%

1,455,351% as a decimal14,553.51

1,455,351% of 1001,455,351

1,455,351% of 1,00014,553,510

As a fraction of 1001,455,351/100

Read another way

As seconds16 days, 20 hours and 15 minutes

As bytes1.388 MiB

As a 24-bit colour#1634F7

Keep nerding

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