Recognised as Number
79,401
- Positive
- Odd
- Composite
- 5 digits
79,401 is an odd 5-digit integer and a composite number. It has 16 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value79,401
Digit count5
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Triangular numberYes, the 398th triangular number
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 7 × 19 × 199
Distinct prime factors43, 7, 19, 199
Number of divisors16
Sum of divisors σ(n)128,000
Aliquot sum48,599sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)42,768integers below n that share no factor with it
Carmichael function λ(n)198the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 42,768
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 7, 19, 21, 57, 133, 199, 399, 597, 1,393, 3,781, 4,179, 11,343, 26,467, 79,40116 in total
Arithmetic
Representations
Decimal79,401
Binary1001101100010100117 bits
Octal233051
Hexadecimal13629
Base 361P9L
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-nine thousand, four hundred and one
Ordinalseventy-nine thousand, four hundred and first
Scientific notation7.9401 × 10^4
Engineering notation79.401 × 10^3
In other bases
Ternary11000220210base 3; the most digit-efficient integer base after e: 11 digits
Quinary10020101base 5; one hand: 8 digits
Septenary450330base 7: 6 digits
Nonary130823base 9; each digit is two ternary digits: 6 digits
Duodecimal39b49base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal9ia1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal22:3:21base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary110010T1T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100101001111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010011011000101001
Bit length17 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits9within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 36 29
Gray code11010110100111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010011011000101001
64-bit0000000000000000000000000000000000000000000000010011011000101001
One's complement11111111111111101100100111010110at 32 bits, every bit flipped
Bits reversed10010100011011001000000000000000at 32 bits
Rotated left by 100000000000000100110110001010010at 32 bits, wrapping
Shifted left by 1100110110001010010= 158,802, no wrap
Shifted right by 11001101100010100= 39,700, discarding the low bit
These bits as a double3.92293063 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
79,401 to the power 26,304,518,801
79,401 to the power 3500,585,097,318,201
79,401 to the power 439,746,957,312,162,477,601
79,401 to the power 53,155,948,157,543,012,883,997,001
First ten multiples79,401, 158,802, 238,203, 317,604, 397,005, 476,406, 555,807, 635,208, 714,609, 794,010
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
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 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1107the total stopping time
Highest value reached5,151,11264× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps79,401 → 238,204 → 119,102 → 59,551 → 178,654 → 89,327 → 267,982 → 133,991 → 401,974 → 200,987 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,940,100%
79,401% as a decimal794.01
79,401% of 10079,401
79,401% of 1,000794,010
As a fraction of 10079,401/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 79,401
Nerdulate something else
Nothing in mind? Surprise me · today’s page