Recognised as Number
7,368,967
- Positive
- Odd
- Prime
- 7 digits
7,368,967 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value7,368,967
Digit count7
Digit sum46
Digit product381,024
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7,368,967
Distinct prime factors17,368,967
Number of divisors2
Sum of divisors σ(n)7,368,968
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,368,966integers below n that share no factor with it
Carmichael function λ(n)7,368,966the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 7,368,9672 in total
Arithmetic
Previous number7,368,966
Next number7,368,968
Double14,737,934
Half3,684,483.5
Square54,301,674,647,089
Cube400,147,248,519,135,487,063
Square root2,714.584130212≈irrational, shown to 9 decimal places
Cube root194.596729597≈
Negation-7,368,967
Reciprocal1.35704231 × 10^-7≈
Representations
Decimal7,368,967
Binary1110000011100010000011123 bits
Octal34070407
Hexadecimal707107
Base 364DXXJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, three hundred and sixty-eight thousand, nine hundred and sixty-seven
Ordinalseven million, three hundred and sixty-eight thousand, nine hundred and sixty-seventh
Scientific notation7.368967 × 10^6
Engineering notation7.368967 × 10^6
In other bases
Ternary111212101022201base 3; the most digit-efficient integer base after e: 15 digits
Quinary3341301332base 5; one hand: 10 digits
Septenary116430604base 7: 9 digits
Nonary14771281base 9; each digit is two ternary digits: 8 digits
Duodecimal2574547base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal261287base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal34:6:56:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT0TT101100T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101100011011000100011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011100000111000100000111
Bit length23 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits13within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes370 71 07
Gray code10010000100100110000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011100000111000100000111
64-bit0000000000000000000000000000000000000000011100000111000100000111
One's complement11111111100011111000111011111000at 32 bits, every bit flipped
Bits reversed11100000100011100000111000000000at 32 bits
Rotated left by 100000000111000001110001000001110at 32 bits, wrapping
Shifted left by 1111000001110001000001110= 14,737,934, no wrap
Shifted right by 11110000011100010000011= 3,684,483, discarding the low bit
These bits as a double3.64075344 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,368,967 to the power 254,301,674,647,089
7,368,967 to the power 3400,147,248,519,135,487,063
7,368,967 to the power 42,948,671,869,478,308,272,696,173,921
7,368,967 to the power 521,728,665,700,013,960,877,325,106,650,109,607
First ten multiples7,368,967, 14,737,934, 22,106,901, 29,475,868, 36,844,835, 44,213,802, 51,582,769, 58,951,736, 66,320,703, 73,689,670
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 67
Collatz (3n + 1) trajectory
Steps to reach 1111the total stopping time
Highest value reached49,740,5326× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,368,967 → 22,106,902 → 11,053,451 → 33,160,354 → 16,580,177 → 49,740,532 → 24,870,266 → 12,435,133 → 37,305,400 → 18,652,700 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage736,896,700%
7,368,967% as a decimal73,689.67
7,368,967% of 1007,368,967
7,368,967% of 1,00073,689,670
As a fraction of 1007,368,967/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 7,368,967
Nerdulate something else
Nothing in mind? Surprise me · today’s page