Recognised as Number
1,341,024,401
- Positive
- Odd
- Composite
- 10 digits
1,341,024,401 is an odd 10-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,341,024,401
Digit count10
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,741 × 770,261
Distinct prime factors21,741, 770,261
Number of divisors4
Sum of divisors σ(n)1,341,796,404
Aliquot sum772,003sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,340,252,400integers below n that share no factor with it
Carmichael function λ(n)67,012,620the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,340,252,400
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,741, 770,261, 1,341,024,4014 in total
Arithmetic
Previous number1,341,024,400
Next number1,341,024,402
Double2,682,048,802
Half670,512,200.5
Square1,798,346,444,077,408,801
Cube2,411,626,462,959,387,134,993,153,201
Square root36,620.000013654≈irrational, shown to 9 decimal places
Cube root1,102.754639002≈
Negation-1,341,024,401
Reciprocal7.45698586 × 10^-10≈
Representations
Decimal1,341,024,401
Binary100111111101110011010001001000131 bits
Octal11773464221
Hexadecimal4FEE6891
Base 36M6ET1T
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone billion, three hundred and forty-one million, twenty-four thousand, four hundred and one
Ordinalone billion, three hundred and forty-one million, twenty-four thousand, four hundred and first
Scientific notation1.3410244 × 10^9
Engineering notation1.341024 × 10^9
In other bases
Ternary10110110101002122102base 3; the most digit-efficient integer base after e: 20 digits
Quinary10221300240101base 5; one hand: 14 digits
Septenary45142343063base 7: 11 digits
Nonary3413332572base 9; each digit is two ternary digits: 10 digits
Duodecimal315133955base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 9 digits
Vigesimal10j18101base 20; hands and feet, and the Mayan and Yoruba systems: 8 digits
Sexagesimal1:43:28:26:46:41base 60; Babylonian, and still how an hour and a circle are divided: 6 digits
Balanced ternary10110110101010T0T11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1010000001100111011100110010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
01001111111011100110100010010001
Bit length31 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits14within that length
Bit parityodd17 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 ee 68 91
Gray code1101000000110010101110011011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit01001111111011100110100010010001
64-bit0000000000000000000000000000000001001111111011100110100010010001
One's complement10110000000100011001011101101110at 32 bits, every bit flipped
Bits reversed10001001000101100111011111110010at 32 bits
Rotated left by 110011111110111001101000100100010at 32 bits, wrapping
Shifted left by 110011111110111001101000100100010= 2,682,048,802, no wrap
Shifted right by 1100111111101110011010001001000= 670,512,200, discarding the low bit
These bits as a double6.62554087 × 10^-315≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,341,024,401 to the power 21,798,346,444,077,408,801
1,341,024,401 to the power 32,411,626,462,959,387,134,993,153,201
1,341,024,401 to the power 43,234,049,932,925,860,820,031,299,410,472,257,601
1,341,024,401 to the power 5433693987410599268359184209318… (46 digits)
First ten multiples1,341,024,401, 2,682,048,802, 4,023,073,203, 5,364,097,604, 6,705,122,005, 8,046,146,406, 9,387,170,807, 10,728,195,208, 12,069,219,609, 13,410,244,010
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 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1134the total stopping time
Highest value reached4,023,073,2043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,341,024,401 → 4,023,073,204 → 2,011,536,602 → 1,005,768,301 → 3,017,304,904 → 1,508,652,452 → 754,326,226 → 377,163,113 → 1,131,489,340 → 565,744,670 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage134,102,440,100%
1,341,024,401% as a decimal13,410,244.01
1,341,024,401% of 1001,341,024,401
1,341,024,401% of 1,00013,410,244,010
As a fraction of 1001,341,024,401/100
Read another way
As seconds42 years, 180 days and 14 hours
As bytes1.249 GiB
As a Unix timestamp2012-06-30 02:46:41 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,024,401
Nearby primes
Also reads as
1341024401 (identifier)
- 10 characters
- Checksum fails
1341024401 matches the shape of ISBN-10, Luhn (cards, IMEI). No check digit validates. 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 does not matchmod 11 with weights 10 down to 1
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
What this does not tell you
ExistenceNot checkedno network lookup is made, ever
Ownership or validity in useNot checked
Also reads as
1,341,024,401 (unix timestamp)
- Unix time
- Saturday
- After the epoch
Unix timestamp 1,341,024,401 is 2012-06-30 02:46:41 UTC, a Saturday. In milliseconds it is 1,341,024,401,000, and it falls 15,521.1 days after the Unix epoch of 1 January 1970.
The moment
Unix timestamp (seconds)1,341,024,401
Unix timestamp (milliseconds)1,341,024,401,000
ISO 8601 (UTC)2012-06-30T02:46:41.000Z
Date (UTC)30 June 2012
Time (UTC)02:46:41
Day of the weekSaturday
RFC 2822Sat, 30 Jun 2012 02:46:41 GMT
Epoch arithmetic
Days since the epoch15,521.1158
Hours since the epoch372,506
Weeks since the epoch2,217.3023
Seconds until the year 2038 problem806,459,246when a signed 32-bit time_t overflows
One hour later1,341,028,001
One day later1,341,110,801
One year later1,372,560,401
Relative to now
These values depend on today’s date and change daily.
In the past by14 years, 118 days and 19 hours
Timestamp when this page rendered1,793,096,390
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