Recognised as Number
9,264,130
- Positive
- Even
- Composite
- 7 digits
9,264,130 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value9,264,130
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 5 × 337 × 2,749
Distinct prime factors42, 5, 337, 2,749
Number of divisors16
Sum of divisors σ(n)16,731,000
Aliquot sum7,466,870sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,693,312integers below n that share no factor with it
Carmichael function λ(n)76,944the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,693,312
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 337, 674, 1,685, 2,749, 3,370, 5,498, 13,745, 27,490, 926,413, 1,852,826, 4,632,065, 9,264,13016 in total
Arithmetic
Previous number9,264,129
Next number9,264,131
Double18,528,260
Half4,632,065
Square85,824,104,656,900
Cube795,085,662,675,126,997,000
Square root3,043.703336398≈irrational, shown to 9 decimal places
Cube root210.023655687≈
Negation-9,264,130
Reciprocal1.07943218 × 10^-7≈
Representations
Decimal9,264,130
Binary10001101010111000000001024 bits
Octal43256002
Hexadecimal8D5C02
Base 365IK8Y
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, two hundred and sixty-four thousand, one hundred and thirty
Ordinalnine million, two hundred and sixty-four thousand, one hundred and thirtieth
Scientific notation9.26413 × 10^6
Engineering notation9.26413 × 10^6
In other bases
Ternary122102122222221base 3; the most digit-efficient integer base after e: 15 digits
Quinary4332423010base 5; one hand: 10 digits
Septenary141513061base 7: 9 digits
Nonary18378887base 9; each digit is two ternary digits: 8 digits
Duodecimal312922abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2hi06abase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal42:53:22:10base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T110T000000T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100100101010110000000110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100011010101110000000010
Bit length24 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits15within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes38d 5c 02
Gray code110010111111001000000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100011010101110000000010
64-bit0000000000000000000000000000000000000000100011010101110000000010
One's complement11111111011100101010001111111101at 32 bits, every bit flipped
Bits reversed01000000001110101011000100000000at 32 bits
Rotated left by 100000001000110101011100000000100at 32 bits, wrapping
Shifted left by 11000110101011100000000100= 18,528,260, no wrap
Shifted right by 110001101010111000000001= 4,632,065, discarding the low bit
These bits as a double4.57708837 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,264,130 to the power 285,824,104,656,900
9,264,130 to the power 3795,085,662,675,126,997,000
9,264,130 to the power 47,365,776,940,158,524,266,717,610,000
9,264,130 to the power 568,237,515,124,630,789,415,026,612,329,300,000
First ten multiples9,264,130, 18,528,260, 27,792,390, 37,056,520, 46,320,650, 55,584,780, 64,848,910, 74,113,040, 83,377,170, 92,641,300
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8No, remainder 2
Divisible by 9No, remainder 7
Divisible by 10Yes
Divisible by 11No, remainder 7
Divisible by 12No, remainder 10
Divisible by 100No, remainder 30
Collatz (3n + 1) trajectory
Steps to reach 1194the total stopping time
Highest value reached14,839,3601× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,264,130 → 4,632,065 → 13,896,196 → 6,948,098 → 3,474,049 → 10,422,148 → 5,211,074 → 2,605,537 → 7,816,612 → 3,908,306 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage926,413,000%
9,264,130% as a decimal92,641.3
9,264,130% of 1009,264,130
9,264,130% of 1,00092,641,300
As a fraction of 1009,264,130/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 9,264,130
Nerdulate something else
Nothing in mind? Surprise me · today’s page