Number
8,940,801
- Positive
- Odd
- Composite
- 7 digits
8,940,801 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value8,940,801
Digit count7
Digit sum30
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 59 × 50,513
Distinct prime factors33, 59, 50,513
Number of divisors8
Sum of divisors σ(n)12,123,360
Aliquot sum3,182,559sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,859,392integers below n that share no factor with it
SquarefreeYesno repeated prime factor
All divisors1, 3, 59, 177, 50,513, 151,539, 2,980,267, 8,940,8018 in total
Arithmetic
Previous number8,940,800
Next number8,940,802
Double17,881,602
Half4,470,400.5
Square79,937,922,521,601
Cube714,709,057,619,052,742,401
Square root2,990.117221782≈irrational, shown to 9 decimal places
Cube root207.551308742≈
Negation-8,940,801
Reciprocal1.11846802 × 10^-7≈
Representations
Decimal8,940,801
Binary10001000011011010000000124 bits
Octal42066401
Hexadecimal886D01
Base 365BMRL
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, nine hundred and forty thousand, eight hundred and one
Ordinaleight million, nine hundred and forty thousand, eight hundred and first
Scientific notation8.940801 × 10^6
Engineering notation8.940801 × 10^6
Nearest landmarks
Powers & multiples
8,940,801 to the power 279,937,922,521,601
8,940,801 to the power 3714,709,057,619,052,742,401
8,940,801 to the power 46,390,071,457,069,484,378,311,603,201
8,940,801 to the power 557,132,357,273,438,302,999,092,760,211,104,001
First ten multiples8,940,801, 17,881,602, 26,822,403, 35,763,204, 44,704,005, 53,644,806, 62,585,607, 71,526,408, 80,467,209, 89,408,010
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
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 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1119the total stopping time
Highest value reached32,223,2563× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,940,801 → 26,822,404 → 13,411,202 → 6,705,601 → 20,116,804 → 10,058,402 → 5,029,201 → 15,087,604 → 7,543,802 → 3,771,901 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage894,080,100%
8,940,801% as a decimal89,408.01
8,940,801% of 1008,940,801
8,940,801% of 1,00089,408,010
As a fraction of 1008,940,801/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 8,940,801
Nerdulate something else
Nothing in mind? Surprise me · today’s page