Recognised as Number
1,395,159
- Positive
- Odd
- Composite
- 7 digits
1,395,159 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,395,159
Digit count7
Digit sum33
Digit product6,075
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 × 37 × 12,569
Distinct prime factors33, 37, 12,569
Number of divisors8
Sum of divisors σ(n)1,910,640
Aliquot sum515,481sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)904,896integers below n that share no factor with it
Carmichael function λ(n)113,112the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 904,896
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 37, 111, 12,569, 37,707, 465,053, 1,395,1598 in total
Arithmetic
Previous number1,395,158
Next number1,395,160
Double2,790,318
Half697,579.5
Square1,946,468,635,281
Cube2,715,633,234,730,004,679
Square root1,181.168489251≈irrational, shown to 9 decimal places
Cube root111.739803082≈
Negation-1,395,159
Reciprocal7.16764182 × 10^-7≈
Representations
Decimal1,395,159
Binary10101010010011101011121 bits
Octal5244727
Hexadecimal1549D7
Base 36TWIF
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and ninety-five thousand, one hundred and fifty-nine
Ordinalone million, three hundred and ninety-five thousand, one hundred and fifty-ninth
Scientific notation1.395159 × 10^6
Engineering notation1.395159 × 10^6
In other bases
Ternary2121212210120base 3; the most digit-efficient integer base after e: 13 digits
Quinary324121114base 5; one hand: 9 digits
Septenary14600343base 7: 8 digits
Nonary2555716base 9; each digit is two ternary digits: 7 digits
Duodecimal573473base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8e7hjbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:27:32:39base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0T0T0T11TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010101111000101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101010100100111010111
Bit length21 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits9within that length
Bit parityeven12 set bits, so even; 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
Bytes315 49 d7
Gray code111111110110100111100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101010100100111010111
64-bit0000000000000000000000000000000000000000000101010100100111010111
One's complement11111111111010101011011000101000at 32 bits, every bit flipped
Bits reversed11101011100100101010100000000000at 32 bits
Rotated left by 100000000001010101001001110101110at 32 bits, wrapping
Shifted left by 11010101001001110101110= 2,790,318, no wrap
Shifted right by 110101010010011101011= 697,579, discarding the low bit
These bits as a double6.89300132 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,395,159 to the power 21,946,468,635,281
1,395,159 to the power 32,715,633,234,730,004,679
1,395,159 to the power 43,788,740,148,132,678,597,948,961
1,395,159 to the power 55,285,894,916,328,639,740,035,874,479,799
First ten multiples1,395,159, 2,790,318, 4,185,477, 5,580,636, 6,975,795, 8,370,954, 9,766,113, 11,161,272, 12,556,431, 13,951,590
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 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 3
Divisible by 100No, remainder 59
Collatz (3n + 1) trajectory
Steps to reach 1155the total stopping time
Highest value reached12,081,4728× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,395,159 → 4,185,478 → 2,092,739 → 6,278,218 → 3,139,109 → 9,417,328 → 4,708,664 → 2,354,332 → 1,177,166 → 588,583 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage139,515,900%
1,395,159% as a decimal13,951.59
1,395,159% of 1001,395,159
1,395,159% of 1,00013,951,590
As a fraction of 1001,395,159/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,395,159
Nerdulate something else
Nothing in mind? Surprise me · today’s page