Recognised as Number

1,229,827

Positive
Odd
Prime
7 digits

1,229,827 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,229,827

Digit count7

Digit sum31

Digit product4,032

Multiplicative persistence2times 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,229,827

Distinct prime factors11,229,827

Number of divisors2

Sum of divisors σ(n)1,229,828

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,229,826the 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,229,8272 in total

Arithmetic

Previous number1,229,826

Next number1,229,828

Double2,459,654

Half614,913.5

Square1,512,474,449,929

Cube1,860,081,915,332,832,283

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

Cube root107.139103445≈

Negation-1,229,827

Reciprocal8.13122496 × 10^-7≈

Representations

Decimal1,229,827

Binary10010110001000000001121 bits

Octal4542003

Hexadecimal12C403

Base 36QCXV

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

In wordsone million, two hundred and twenty-nine thousand, eight hundred and twenty-seven

Ordinalone million, two hundred and twenty-nine thousand, eight hundred and twenty-seventh

Scientific notation1.229827 × 10^6

Engineering notation1.229827 × 10^6

In other bases

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

Quinary303323302base 5; one hand: 9 digits

Septenary13311334base 7: 8 digits

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

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

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

Sexagesimal5:41:37:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100101100010000000011

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

Bytes312 c4 03

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

At each machine width

32-bit00000000000100101100010000000011

64-bit0000000000000000000000000000000000000000000100101100010000000011

One's complement11111111111011010011101111111100at 32 bits, every bit flipped

Bits reversed11000000001000110100100000000000at 32 bits

Rotated left by 100000000001001011000100000000110at 32 bits, wrapping

Shifted left by 11001011000100000000110= 2,459,654, no wrap

Shifted right by 110010110001000000001= 614,913, discarding the low bit

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

Nearest landmarks

Next prime1,229,869+42

Previous prime1,229,807−20

Distance to nearest prime0, it is prime

Nearest square below1,227,664

Nearest square above1,229,881

Powers & multiples

1,229,827 to the power 21,512,474,449,929

1,229,827 to the power 31,860,081,915,332,832,283

1,229,827 to the power 42,287,578,961,688,031,128,105,041

1,229,827 to the power 52,813,326,371,715,906,258,184,038,257,907

First ten multiples1,229,827, 2,459,654, 3,689,481, 4,919,308, 6,149,135, 7,378,962, 8,608,789, 9,838,616, 11,068,443, 12,298,270

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 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 3

Divisible by 9No, remainder 4

Divisible by 10No, remainder 7

Divisible by 11No, remainder 5

Divisible by 12No, remainder 7

Divisible by 100No, remainder 27

Collatz (3n + 1) trajectory

Steps to reach 1173the total stopping time

Highest value reached5,534,2244× the starting value

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

First steps1,229,827 → 3,689,482 → 1,844,741 → 5,534,224 → 2,767,112 → 1,383,556 → 691,778 → 345,889 → 1,037,668 → 518,834 → …

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

As a percentage & fraction

As a percentage122,982,700%

1,229,827% as a decimal12,298.27

1,229,827% of 1001,229,827

1,229,827% of 1,00012,298,270

As a fraction of 1001,229,827/100

Read another way

As seconds14 days, 5 hours and 37 minutes

As bytes1.173 MiB

As a 24-bit colour#12C403

Keep nerding

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