Recognised as Number
1,341,097,641
- Positive
- Odd
- Composite
- Perfect square
- 10 digits
1,341,097,641 is an odd 10-digit integer and a composite number. It has 45 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,341,097,641
Digit count10
Digit sum36
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 36,621²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^4 × 13^2 × 313^2
Distinct prime factors33, 13, 313
Number of divisors45
Sum of divisors σ(n)2,176,280,469
Aliquot sum835,182,828sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)822,654,144integers below n that share no factor with it
Carmichael function λ(n)878,904the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 822,654,144
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 13, 27, 39, 81, 117, 169, 313, 351, 507, 939, 1,053, 1,521, 2,817, 4,069, 4,563, 8,451, 12,207, 13,689, 25,353, 36,621, 52,897, 97,969, 109,863, 158,691, 293,907, 329,589, 476,073, 881,721, 1,273,597, 1,428,219, 2,645,163, 3,820,791, 4,284,657, 7,935,489, 11,462,373, 16,556,761, 34,387,119, 49,670,283, 103,161,357, 149,010,849, 447,032,547, 1,341,097,64145 in total
Arithmetic
Previous number1,341,097,640
Next number1,341,097,642
Double2,682,195,282
Half670,548,820.5
Square1,798,542,882,695,764,881
Cube2,412,021,617,220,630,002,599,745,721
Square root36,621exact
Cube root1,102.774714272≈
Negation-1,341,097,641
Reciprocal7.45657862 × 10^-10≈
Representations
Decimal1,341,097,641
Binary100111111101111100001101010100131 bits
Octal11773703251
Hexadecimal4FEF86A9
Base 36M6GDK9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone billion, three hundred and forty-one million, ninety-seven thousand, six hundred and forty-one
Ordinalone billion, three hundred and forty-one million, ninety-seven thousand, six hundred and forty-first
Scientific notation1.34109764 × 10^9
Engineering notation1.341098 × 10^9
In other bases
Ternary10110110111211010000base 3; the most digit-efficient integer base after e: 20 digits
Quinary10221310111031base 5; one hand: 14 digits
Septenary45143066442base 7: 11 digits
Nonary3413454100base 9; each digit is two ternary digits: 10 digits
Duodecimal31516a209base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 9 digits
Vigesimal10j1h421base 20; hands and feet, and the Mayan and Yoruba systems: 8 digits
Sexagesimal1:43:28:47:7:21base 60; Babylonian, and still how an hour and a circle are divided: 6 digits
Balanced ternary10110111TTTT11010000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1010000001100001001101111111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
01001111111011111000011010101001
Bit length31 bitsto write the magnitude
Set bits19the population count, or Hamming weight
Zero bits12within that length
Bit parityodd19 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 30worth 1,073,741,824
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes44f ef 86 a9
Gray code1101000000110000100010111111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit01001111111011111000011010101001
64-bit0000000000000000000000000000000001001111111011111000011010101001
One's complement10110000000100000111100101010110at 32 bits, every bit flipped
Bits reversed10010101011000011111011111110010at 32 bits
Rotated left by 110011111110111110000110101010010at 32 bits, wrapping
Shifted left by 110011111110111110000110101010010= 2,682,195,282, no wrap
Shifted right by 1100111111101111100001101010100= 670,548,820, discarding the low bit
These bits as a double6.62590272 × 10^-315≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,341,097,641 to the power 21,798,542,882,695,764,881
1,341,097,641 to the power 32,412,021,617,220,630,002,599,745,721
1,341,097,641 to the power 43,234,756,500,895,591,873,020,342,853,632,944,161
1,341,097,641 to the power 5433812431256049264820635334601… (46 digits)
First ten multiples1,341,097,641, 2,682,195,282, 4,023,292,923, 5,364,390,564, 6,705,488,205, 8,046,585,846, 9,387,683,487, 10,728,781,128, 12,069,878,769, 13,410,976,410
Powers of twoBetween 2^30 (1,073,741,824) and 2^31 (2,147,483,648)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 9
Divisible by 100No, remainder 41
Collatz (3n + 1) trajectory
Steps to reach 1209the total stopping time
Highest value reached51,556,298,63238× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,341,097,641 → 4,023,292,924 → 2,011,646,462 → 1,005,823,231 → 3,017,469,694 → 1,508,734,847 → 4,526,204,542 → 2,263,102,271 → 6,789,306,814 → 3,394,653,407 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage134,109,764,100%
1,341,097,641% as a decimal13,410,976.41
1,341,097,641% of 1001,341,097,641
1,341,097,641% of 1,00013,410,976,410
As a fraction of 1001,341,097,641/100
Read another way
As seconds42 years, 181 days and 11 hours
As bytes1.249 GiB
As a Unix timestamp2012-06-30 23:07:21 UTC
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 1,341,097,641
Nearby primes
Also reads as
1341097641 (identifier)
- 10 characters
- Checksum valid
1341097641 matches the shape of ISBN-10, Luhn (cards, IMEI). The check digit is valid for ISBN-10. A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.
Checksum tests
ISBN-10Check digit validmod 11 with weights 10 down to 1
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
Structure
As ISBN-139781341097645the 978 prefix plus a recomputed check digit
What this does not tell you
ExistenceNot checkedno network lookup is made, ever
Ownership or validity in useNot checked
Also reads as
1,341,097,641 (unix timestamp)
- Unix time
- Saturday
- After the epoch
Unix timestamp 1,341,097,641 is 2012-06-30 23:07:21 UTC, a Saturday. In milliseconds it is 1,341,097,641,000, and it falls 15,522 days after the Unix epoch of 1 January 1970.
The moment
Unix timestamp (seconds)1,341,097,641
Unix timestamp (milliseconds)1,341,097,641,000
ISO 8601 (UTC)2012-06-30T23:07:21.000Z
Date (UTC)30 June 2012
Time (UTC)23:07:21
Day of the weekSaturday
RFC 2822Sat, 30 Jun 2012 23:07:21 GMT
Epoch arithmetic
Days since the epoch15,521.9634
Hours since the epoch372,527
Weeks since the epoch2,217.4233
Seconds until the year 2038 problem806,386,006when a signed 32-bit time_t overflows
One hour later1,341,101,241
One day later1,341,184,041
One year later1,372,633,641
Relative to now
These values depend on today’s date and change daily.
In the past by14 years, 118 days and 13 hours
Timestamp when this page rendered1,793,149,579
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
This moment elsewhere
Nerdulate something else
Nothing in mind? Surprise me · today’s page