Recognised as Number

1,469,311

Positive
Odd
Prime
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,469,311

Digit count7

Digit sum25

Digit product648

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,469,311

Distinct prime factors11,469,311

Number of divisors2

Sum of divisors σ(n)1,469,312

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,469,310the 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,469,3112 in total

Arithmetic

Previous number1,469,310

Next number1,469,312

Double2,938,622

Half734,655.5

Square2,158,874,814,721

Cube3,172,058,512,892,527,231

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

Cube root113.685369234≈

Negation-1,469,311

Reciprocal6.80591107 × 10^-7≈

Representations

Decimal1,469,311

Binary10110011010110111111121 bits

Octal5465577

Hexadecimal166B7F

Base 36VHQ7

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

In wordsone million, four hundred and sixty-nine thousand, three hundred and eleven

Ordinalone million, four hundred and sixty-nine thousand, three hundred and eleventh

Scientific notation1.469311 × 10^6

Engineering notation1.469311 × 10^6

In other bases

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

Quinary334004221base 5; one hand: 9 digits

Septenary15326464base 7: 8 digits

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

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

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

Sexagesimal6:48:8:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101100110101101111111

Bit length21 bitsto write the magnitude

Set bits15the population count, or Hamming weight

Zero bits6within that length

Bit parityodd15 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 6b 7f

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

At each machine width

32-bit00000000000101100110101101111111

64-bit0000000000000000000000000000000000000000000101100110101101111111

One's complement11111111111010011001010010000000at 32 bits, every bit flipped

Bits reversed11111110110101100110100000000000at 32 bits

Rotated left by 100000000001011001101011011111110at 32 bits, wrapping

Shifted left by 11011001101011011111110= 2,938,622, no wrap

Shifted right by 110110011010110111111= 734,655, discarding the low bit

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

Nearest landmarks

Next prime1,469,323+12

Previous prime1,469,291−20

Distance to nearest prime0, it is prime

Nearest square below1,468,944

Nearest square above1,471,369

Powers & multiples

1,469,311 to the power 22,158,874,814,721

1,469,311 to the power 33,172,058,512,892,527,231

1,469,311 to the power 44,660,740,465,636,632,078,307,841

1,469,311 to the power 56,848,077,234,305,025,515,610,572,167,551

First ten multiples1,469,311, 2,938,622, 4,407,933, 5,877,244, 7,346,555, 8,815,866, 10,285,177, 11,754,488, 13,223,799, 14,693,110

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 7

Divisible by 10No, remainder 1

Divisible by 11No, remainder 8

Divisible by 12No, remainder 7

Divisible by 100No, remainder 11

Collatz (3n + 1) trajectory

Steps to reach 1225the total stopping time

Highest value reached63,545,95643× the starting value

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

First steps1,469,311 → 4,407,934 → 2,203,967 → 6,611,902 → 3,305,951 → 9,917,854 → 4,958,927 → 14,876,782 → 7,438,391 → 22,315,174 → …

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

As a percentage & fraction

As a percentage146,931,100%

1,469,311% as a decimal14,693.11

1,469,311% of 1001,469,311

1,469,311% of 1,00014,693,110

As a fraction of 1001,469,311/100

Read another way

As seconds17 days, 8 minutes and 31 seconds

As bytes1.401 MiB

As a 24-bit colour#166B7F

Keep nerding

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