Recognised as Number
1,148,693
- Positive
- Odd
- Composite
- 7 digits
1,148,693 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,148,693
Digit count7
Digit sum32
Digit product5,184
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7 × 13^2 × 971
Distinct prime factors37, 13, 971
Number of divisors12
Sum of divisors σ(n)1,423,008
Aliquot sum274,315sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)907,920integers below n that share no factor with it
Carmichael function λ(n)75,660the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 907,920
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 7, 13, 91, 169, 971, 1,183, 6,797, 12,623, 88,361, 164,099, 1,148,69312 in total
Arithmetic
Previous number1,148,692
Next number1,148,694
Double2,297,386
Half574,346.5
Square1,319,495,608,249
Cube1,515,695,368,726,368,557
Square root1,071.770964339≈irrational, shown to 9 decimal places
Cube root104.729249539≈
Negation-1,148,693
Reciprocal8.70554622 × 10^-7≈
Representations
Decimal1,148,693
Binary10001100001110001010121 bits
Octal4303425
Hexadecimal118715
Base 36OMC5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and forty-eight thousand, six hundred and ninety-three
Ordinalone million, one hundred and forty-eight thousand, six hundred and ninety-third
Scientific notation1.148693 × 10^6
Engineering notation1.148693 × 10^6
In other bases
Ternary2011100201012base 3; the most digit-efficient integer base after e: 13 digits
Quinary243224233base 5; one hand: 9 digits
Septenary12522650base 7: 8 digits
Nonary2140635base 9; each digit is two ternary digits: 7 digits
Duodecimal474905base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal73bedbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:19:4:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T011101T011TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101101001101100010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100011000011100010101
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 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
Bytes311 87 15
Gray code110010100010010011111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100011000011100010101
64-bit0000000000000000000000000000000000000000000100011000011100010101
One's complement11111111111011100111100011101010at 32 bits, every bit flipped
Bits reversed10101000111000011000100000000000at 32 bits
Rotated left by 100000000001000110000111000101010at 32 bits, wrapping
Shifted left by 11000110000111000101010= 2,297,386, no wrap
Shifted right by 110001100001110001010= 574,346, discarding the low bit
These bits as a double5.67529749 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,148,693 to the power 21,319,495,608,249
1,148,693 to the power 31,515,695,368,726,368,557
1,148,693 to the power 41,741,068,660,188,398,476,846,001
1,148,693 to the power 51,999,953,382,477,792,011,563,663,426,693
First ten multiples1,148,693, 2,297,386, 3,446,079, 4,594,772, 5,743,465, 6,892,158, 8,040,851, 9,189,544, 10,338,237, 11,486,930
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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 93
Collatz (3n + 1) trajectory
Steps to reach 154the total stopping time
Highest value reached3,446,0803× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,148,693 → 3,446,080 → 1,723,040 → 861,520 → 430,760 → 215,380 → 107,690 → 53,845 → 161,536 → 80,768 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage114,869,300%
1,148,693% as a decimal11,486.93
1,148,693% of 1001,148,693
1,148,693% of 1,00011,486,930
As a fraction of 1001,148,693/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 1,148,693
Nerdulate something else
Nothing in mind? Surprise me · today’s page